Structured discrete shape approximation: theoretical complexity and practical algorithm

DOI10.1016/j.comgeo.2021.101795OpenAlexW3166203745MaRDI QIDQ824342

Andreas M. Tillmann, Leif Kobbelt

Publication date: 15 December 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.09217

zbMATH Keywords

computational complexitymixed-integer programmingshape approximationdiscrete assembly systemszometool

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-perimeter enclosures
• Minimum-link paths among obstacles in the plane
• Computing minimum length paths of a given homotopy class
• Minimum-link paths revisited
• OpenFlipper: An Open Source Geometry Processing and Rendering Framework
• On the complexity of minimum-link path problems
• Surface Approximation and Geometric Partitions
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• ON GEOMETRIC PATH QUERY PROBLEMS