The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

1.6.7 Point Location ● Kd-Trees ● Maintaining Line Arrangements ● Nearest Neighbor Search ● Range Search ● Voronoi Diagrams Go to the corresponding chapter in the book About the Book Send us Mail Go to Main Page This page last modified on Tue Jun 03, 1997 . file:///E|/WEBSITE/FILES2/POINTION.HTM (2 of 2) [19/1/2003 1:36:54]

1.6.10 Medial-Axis Transformation 1.6.10 Medial-Axis Transformation INPUT OUTPUT Input Description: A polygon or polyhedron P . Problem: What is the set of points within P which have more than one closest point on the boundary of P ? Implementations ● Skeletonization Software (2-D) (C) (rating 9) Related Problems ● Minkowski Sum ● Shape Similarity ● Voronoi Diagrams file:///E|/WEBSITE/FILES2/00000011.HTM (1 of 2) [19/1/2003 1:36:54]

1.6.7 Point Location<br />

● Kd-Trees<br />

● Maintaining Line Arrangements<br />

● Nearest Neighbor Search<br />

● Range Search<br />

● Voronoi Diagrams<br />

Go to the corresponding chapter in the book<br />

About the Book<br />

Send us Mail<br />

Go to Main Page<br />

This page last modified on Tue Jun 03, 1997 .<br />

file:///E|/WEBSITE/FILES2/POINTION.HTM (2 of 2) [19/1/2003 1:36:54]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!