On Sun, Jul 14, 2013 at 5:49 AM, Christopher Sean Morrison
wrote:
> How did you go about finding and fixing that particular bit of duplication?
> Looks like it would have been tricky to identify as duplication just by
> reading the code.
I used Simian tool to find duplicacy. It showed only du
> If I'm interpreting the bottom part of p.624 and the top of p.625 in that
> paper correctly, we cannot assume this property holds for general NURBS or
> B-Spline surfaces (intuitively I wouldn't expect it to) but if the paper is
> correct we *can* assume this is true for Bezier patches. There
On Tue, Jul 16, 2013 at 8:49 AM, phoenix <284281...@qq.com> wrote:
>
> Hmm.. For polynomial curves and polynomial surfaces, the theorem is
> satisfied, of course. But for general NURBS surfaces used in BRL-CAD, can
> we make use of this property (which may require C-infinity) so as to
> simplify s
On Tue, Jul 16, 2013 at 12:02 PM, Christopher Sean Morrison
wrote:
>
> On Jul 16, 2013, at 11:59 AM, Tom Browder wrote:
>
>> I just found this reference on O'Reilly's Safari:
My bad again! I thought this was a 2013 edition but what I was
looking at was the date Safar added it.
Still, it's good
On Jul 16, 2013, at 11:59 AM, Tom Browder wrote:
> I just found this reference on O'Reilly's Safari:
>
> An Introduction to NURBS
> By: David F. Rogers
> Publisher: Morgan Kaufmann
> Pub. Date: July 21, 2000
That's as good a place to start as any. Just be aware that there's been more
than a d
On Tue, Jul 16, 2013 at 10:59 AM, Tom Browder wrote:
...
> I just found this reference on O'Reilly's Safari:
>
> An Introduction to NURBS
> By: David F. Rogers
> Publisher: Morgan Kaufmann
> Pub. Date: July 21, 2000
> Print ISBN-13: 978-1-55860-669-2
> Print ISBN-10: 1-55860-669-6
> Web ISBN-13: 9
On Tue, Jul 16, 2013 at 10:45 AM, Christopher Sean Morrison
wrote:
> On Jul 16, 2013, at 11:14 AM, Bryan Bishop wrote:
> On Tue, Jul 16, 2013 at 10:08 AM, Tom Browder wrote:
...
>> My question: is there ONE source (book or paper) that is recommended
>> for a intro to NURBS as they are being used
On Jul 16, 2013, at 11:14 AM, Bryan Bishop wrote:
> On Tue, Jul 16, 2013 at 10:08 AM, Tom Browder wrote:
> My question: is there ONE source (book or paper) that is recommended
> for a intro to NURBS as they are being used (or planned to be used)
> for BRL-CAD (including boolean operations)?
>
>
On Tue, Jul 16, 2013 at 10:14 AM, Bryan Bishop wrote:
> On Tue, Jul 16, 2013 at 10:08 AM, Tom Browder wrote:
>> My question: is there ONE source (book or paper) that is recommended
>> for a intro to NURBS as they are being used (or planned to be used)
>
> This is often cited as being instrumental
On Tue, Jul 16, 2013 at 10:08 AM, Tom Browder wrote:
> My question: is there ONE source (book or paper) that is recommended
> for a intro to NURBS as they are being used (or planned to be used)
> for BRL-CAD (including boolean operations)?
>
This is often cited as being instrumental:
http://libg
Sean just listed a bunch of references for reading about various NURBS issues.
My question: is there ONE source (book or paper) that is recommended
for a intro to NURBS as they are being used (or planned to be used)
for BRL-CAD (including boolean operations)?
Best,
-Tom
On Mon, Jul 15, 2013 at 3:26 PM, Christopher Sean Morrison
wrote:
> On Jul 15, 2013, at 7:32 AM, Tom Browder wrote:
>> I'm just suggesting the macro as a way to help new BRL-CAD builders
>> avoid the same mistake.
>
> I think it's good to make it not be a mistake. It's an entirely reasonable
>
Hi,
Looking at the way the push routine has been implemented I think I
could follow a similar process with implementing a pull; so here is my
current working plan(model) "looked at the xpush implementation too".
Currently Writing the ged_pull() with the following as subroutines:
*Wrote a pull_le
> OK, taking a very quick look at that paper and what you say, I see I
> misunderstood your original question. My bad. However, I think the answer
> may be easier than what I was getting at, in that a polynomial curve is a
> $C^\{infty}$ structure already, so there is no problem at all.
> O
ok thanks sean will continue with the Leaf_mat() routine which
extracts the matrix transformation of the leaves today..
Cheers!
Nyah
On 7/16/13, Christopher Sean Morrison wrote:
>
> On Jul 15, 2013, at 4:54 PM, check.nyah wrote:
>
>> Today, I implemented the pull_leaf routine which forms a linke
On Jul 16, 2013, at 1:52 AM, Bryan Bishop wrote:
> On Mon, Jul 15, 2013 at 11:54 PM, Matt Shepit wrote:
> I cannot access the paper, so I'm only guessing here to a large extent...
>
>
> http://libgen.org/scimag1/10.1016/S0010-4485%252896%252900099-1.pdf
Other relevant research that cites that
16 matches
Mail list logo
