Efficient Computation of Voronoi Diagrams

Simple item page
dc.contributor.authorHumphrey, Matthew C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:50Zen
dc.date.available2013-06-19T14:36:50Zen
dc.date.issued1988en
dc.description.abstractVoronoi diagrams have advantages of representing geometric information in a compact form which makes them well suited for robot path planning. However, researchers have often found them too complex and inefficient. In this paper, two alternate views of Voronoi diagrams, the Standard [SHAMM75a] and the generalized [KIRKD79] are reviewed. A new method to approximate the Voronoi diagram is developed while showing how all three can be effectively used in applications. Finally, the three methods are compared showing their relative strengths and weaknesses for robot path planning.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000092/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000092/01/TR-88-07.pdfen
dc.identifier.trnumberTR-88-07en
dc.identifier.urihttp://hdl.handle.net/10919/19531en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleEfficient Computation of Voronoi Diagramsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-88-07.pdf
Size:
689.92 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports