Polygons with Prescribed Angles in 2D and 3D
From MaRDI portal
Publication:5014111
DOI10.1007/978-3-030-68766-3_11OpenAlexW3124720285MaRDI QIDQ5014111
Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth, Alon Efrat
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.10192
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shape of orthogonal cycles in three dimensions
- Necessary conditions for the global rigidity of direction-length frameworks
- A polygon is determined by its angles
- Infinitesimal rigidity of cone-manifolds and the Stoker problem for hyperbolic and Euclidean polyhedra
- Complexity results for three-dimensional orthogonal graph drawing
- Globally rigid circuits of the direction-length rigidity matroid
- Flattening single-vertex origami: The non-expansive case
- Planarity and duality of finite and infinite graphs
- New results on drawing angle graphs
- Morphing simple polygons
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
- Cross-ratios and angles determine a polygon
- Global rigidity of direction-length frameworks
- Dihedral deformation and rigidity
- Rotation and Winding Numbers for Planar Polygons and Curves
- Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation
- On the Moduli Space of a Spherical Polygonal Linkage
- Constraining Plane Configurations in CAD: Circles, Lines, and Angles in the Plane
- Angles of Planar Triangular Graphs
- Single-Vertex Origami and Spherical Expansive Motions
- How to Draw a Graph
- On the differential geometry of closed space curves
