scientific article; zbMATH DE number 5059852

MaRDI QIDQ5490398zbMATH OpenFDO

Authors Chenglei Yang, Jiaye Wang, Xiangxu Meng

Publication date 4 October 2006

zbMATH Keywords

complexity analysiscomputational geometrymultiply connected polygonpolygonVoronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 17662
• Upper and lower bounds for the Voronoi-Minkowski constant
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• A new duality result concerning Voronoi diagrams
• A new duality result concerning Voronoi diagrams
• scientific article; zbMATH DE number 1804772
• scientific article; zbMATH DE number 4098181
• On the complexity of randomly weighted multiplicative Voronoi diagrams
• An upper bound on average touching number of a Voronoi partition
• scientific article; zbMATH DE number 2133763

Cited in

(3)

• Upper and lower bounds for the Voronoi-Minkowski constant
• Shortest Path Queries in Polygonal Domains
• scientific article; zbMATH DE number 17662 (Why is no real title available?)

Describes a project that uses

Uses Software

• VRONI

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490398)