Spiral Serpentine Polygonization of a Planar Point Set
From MaRDI portal
Publication:4899273
DOI10.1007/978-3-642-34191-5_14zbMath1374.68665OpenAlexW147587971MaRDI QIDQ4899273
Joseph S. B. Mitchell, Justin Iwerks
Publication date: 7 January 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34191-5_14
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polygonizations of point sets in the plane
- Applications of a semi-dynamic convex hull algorithm
- Onion polygonizations
- On simple polygonalizations with optimal area
- On polyhedra induced by point sets in space
- An efficient algorithm for determining the convex hull of a finite planar set
- On the convex layers of a planar set
- Spiral Serpentine Polygonization of a Planar Point Set
- On Some Properties of Shortest Hamiltonian Circuits
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)
This page was built for publication: Spiral Serpentine Polygonization of a Planar Point Set