Compute the Closest Segment for a given point?

[Yaron Ostrovsky-Berman]

Marco,
 
You can use the Voronoi Diagram of line segments. After obtaining the
diagram, you can process it for point location queries.
The new version of CGAL has a class for computing this diagram, if
you’re interested.
 
Yaron
 
-----Original Message-----
From: Marco Carim [mailto:mcarim at dpi.ufv.br] 
Sent: Wednesday, February 23, 2005 15:53
To: compgeom-discuss at research.bell-labs.com
Subject: Compute the Closest Segment for a given point?
 
I am a student of Master Degree in Computer Science and I studing de
following problem: “Let S be a set of n segments and given a query
point, compute the closest segment in S.”
 
Somebody would have references about methods to resolve this problem?
Thanks.
----------------------------------- 
WebMail DPI 
Departamento de Informática 
Universidade Federal de Viçosa 
----------------------------------- 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050301/ac4e285b/attachment.htm