Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
From MaRDI portal
Publication:3057631
DOI10.1007/978-3-642-16926-7_25zbMath1309.68146MaRDI QIDQ3057631
Cyril Gavoille, Nicolas Hanusse, David Ilcinkas, Nicolas Bonichon
Publication date: 16 November 2010
Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_25
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
On plane geometric spanners: a survey and open problems, Theta-3 is connected, On bounded degree plane strong geometric spanners, Fixed-orientation equilateral triangle matching of point sets, Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations, Asymptotics of geometrical navigation on a random set of points in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On plane geometric spanners: a survey and open problems
- Delaunay graphs are almost as good as complete graphs
- Toughness and Delaunay triangulations
- On the geometric dilation of closed curves, graphs, and point sets
- Schnyder woods and orthogonal surfaces
- Planar graphs and poset dimension
- Classes of graphs which approximate the complete Euclidean graph
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Planar graphs as minimal resolutions of trivariate monomial ideals
- There are planar graphs almost as good as the complete graph
- π/2-Angle Yao Graphs Are Spanners
- Geometric Spanner Networks
- Spanners of Additively Weighted Point Sets
- Plane Spanners of Maximum Degree Six
- On the Stretch Factor of Convex Delaunay Graphs
- Generalization of Voronoi Diagrams in the Plane
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
- Distributed Computing: A Locality-Sensitive Approach
- An Optimal Synchronizer for the Hypercube
