Voronoi drawings of trees

DOI10.1016/S0925-7721(02)00137-2zbMath1016.05025WikidataQ62042620 ScholiaQ62042620MaRDI QIDQ1869748

Giuseppe Liotta, Henk G. Meijer

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric graphsVoronoi diagramsGraph drawingEuclidean metricManhattan metricgraph characterization

Mathematics Subject Classification ID

Trees (05C05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (max. 100)

The Voronoi inverse mapping ⋮ PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Bounds on the complexity of halfspace intersections when the bounded faces have small dimension ⋮ Cut locus realizations on convex polyhedra ⋮ Voronoi cells via linear inequality systems ⋮ Realization and connectivity of the graphs of origami flat foldings ⋮ Witness (Delaunay) graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulations without minimum-weight drawing
• Toughness and Delaunay triangulations
• Realizability of Delaunay triangulations
• Transitions in geometric minimum spanning trees
• Drawing outerplanar minimum weight triangulations
• Graph-theoretical conditions for inscribability and Delaunay realizability
• The rectangle of influence drawability problem
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Characterizing proximity trees
• Topology-oriented implementation -- an approach to robust geometric algorithms
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Computing proximity drawings of trees in the 3-dimensional space
• The drawability problem for minimum weight triangulations

This page was built for publication: Voronoi drawings of trees