Meshes Preserving Minimum Feature Size

DOI10.1007/978-3-642-34191-5_25zbMath1374.68633OpenAlexW2180211925MaRDI QIDQ4899286

Erik D. Demaine, Vida Dujmović, John Iacono, Greg Aloupis, Martin L. Demaine

Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/86202

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Dissection with the Fewest Pieces is Hard, Even to Approximate ⋮ Meshes Preserving Minimum Feature Size

Cites Work

• Nice point sets can have nasty Delaunay triangulations
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• Meshes Preserving Minimum Feature Size
• Unnamed Item
• Unnamed Item

This page was built for publication: Meshes Preserving Minimum Feature Size