Subject: CGAL users discussion list
List archive
- From: "Patricio D. Simari" <>
- To:
- Subject: Re: [cgal-discuss] Re: spacial search on mesh vertices
- Date: Sat, 21 Oct 2006 19:39:14 -0400
- Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:sender:to:subject:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references:x-google-sender-auth; b=UgAhwhKyg9JBykQxRQYTCHH1nyyp0shppAL7mTjF67ulnlfiB/544Lb+/Ym1yRhGIeL8alqq0dtkiFqNIRT2kU9Q4BChiJYwy5sXMdJU6ACvKW/SjB1U4H4jW4WIAf8gv5JzUF3602aqPMAw8s0OJUAorlGXdt0bYE+0duwXsOE=
Thanks for the reply.
I've been looking at the examples and it seems this should somehow be
a very simple thing but I'm brand new to CGAL and it's a bit
overwhelming.
If anyone's ever written something similar to this and wouldn't mind
sending it to me so I can see how it's done, I'd appreciate it.
Patricio
On 10/21/06, Sylvain Pion
<>
wrote:
I'd write a traits clas with the vertex type as Point type,
then write the predicates accordingly (forwarding opeartions
to the underlying point).
Patricio D. Simari wrote:
> I should clarify that I would like a reference to an actual vertex
> object, not a point (which has lost the rest of the vertex
> information.)
>
> On 10/20/06, Patricio D. Simari
<>
wrote:
>
>> Hi,
>>
>> Can someone give me a short example showing how to perform a range
>> search or k-nearest neighbour search on the vertices of a mesh stored
>> in a half edge structure?
>>
>> Cheers,
>> Patricio
>>
--
Sylvain
- spacial search on mesh vertices, Patricio D. Simari, 10/21/2006
- Re: spacial search on mesh vertices, Patricio D. Simari, 10/21/2006
- Re: [cgal-discuss] Re: spacial search on mesh vertices, Sylvain Pion, 10/21/2006
- Re: [cgal-discuss] Re: spacial search on mesh vertices, Patricio D. Simari, 10/22/2006
- Re: [cgal-discuss] Re: spacial search on mesh vertices, Sylvain Pion, 10/21/2006
- Re: spacial search on mesh vertices, Patricio D. Simari, 10/21/2006
Archive powered by MHonArc 2.6.16.