Voronoi drawings of trees

DOI10.1016/S0925-7721(02)00137-2zbMATH Open1016.05025DBLPjournals/comgeo/LiottaM03WikidataQ62042620 ScholiaQ62042620MaRDI QIDQ1869748FDOQ1869748

Giuseppe Liotta, Henk Meijer

Publication date: 28 April 2003

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

Recommendations

• Tree Drawings on the Hexagonal Grid
• Trees in triangulations
• Tree drawings revisited
• Tree drawings revisited
• Compact monotone drawing of trees
• scientific article; zbMATH DE number 1424293
• Nearly optimal monotone drawing of trees
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Drawing trees with perfect angular resolution and polynomial area

zbMATH Keywords

Voronoi diagramsEuclidean metricgeometric graphsManhattan metricgraph characterizationGraph drawing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

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

This page was built for publication: Voronoi drawings of trees

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