Greedy drawings of triangulations
From MaRDI portal
Publication:848683
DOI10.1007/S00454-009-9235-6zbMATH Open1213.05180OpenAlexW2014505326MaRDI QIDQ848683FDOQ848683
Authors: Raghavan Dhandapani 
Publication date: 4 March 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9235-6
Recommendations
- An Algorithm to Construct Greedy Drawings of Triangulations
- An Algorithm to Construct Greedy Drawings of Triangulations
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- Fast algorithms for greedy triangulation
- Fast algorithms for greedy triangulation
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- On approximation behavior of the greedy triangulation for convex polygons
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Efficient Planarity Testing
- On a conjecture related to geometric routing
- Title not available (Why is that?)
- Dissections and trees, with applications to optimal mesh encoding and to random sampling
- A Theorem on Planar Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rubber bands, convex embeddings and graph connectivity
- Geometric ad-hoc routing
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Convex drawings of 3-connected plane graphs
- Convex Representations of Graphs
- Strictly convex drawings of planar graphs
- Title not available (Why is that?)
Cited In (24)
- A simple routing algorithm based on Schnyder coordinates
- On planar greedy drawings of 3-connected planar graphs
- Competitive routing in the half-\(\theta_6\)-graph
- On approximation behavior of the greedy triangulation for convex polygons
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Succinct greedy drawings do not always exist
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- On \(k\)-greedy routing algorithms
- Graph Drawing
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- An Algorithm to Construct Greedy Drawings of Triangulations
- Acyclic colorings of graph subdivisions revisited
- Local routing in sparse and lightweight geometric graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Every Schnyder drawing is a greedy embedding
- Partitioning graph drawings and triangulated simple polygons into greedily routable regions
- Euclidean greedy drawings of trees
- Monotone drawings of graphs with few directions
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- On the area requirements of planar greedy drawings of triconnected planar graphs
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
- Levi's Lemma, pseudolinear drawings of , and empty triangles
This page was built for publication: Greedy drawings of triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848683)
