Structured discrete shape approximation: theoretical complexity and practical algorithm
DOI10.1016/J.COMGEO.2021.101795OpenAlexW3166203745MaRDI QIDQ824342FDOQ824342
Authors: 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
Recommendations
computational complexitymixed-integer programmingshape approximationdiscrete assembly systemszometool
Theory of computing (68Qxx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Computing methodologies and applications (68Uxx)
Cites Work
- OpenFlipper: an open source geometry processing and rendering framework
- Title not available (Why is that?)
- Surface Approximation and Geometric Partitions
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Minimum-link paths revisited
- Minimum-perimeter enclosures
- Computing minimum length paths of a given homotopy class
- ON GEOMETRIC PATH QUERY PROBLEMS
- Minimum-link paths among obstacles in the plane
- On the complexity of minimum-link path problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm
- An O(N log N) algorithm for shape modeling.
- Approximation of Large Bending Isometries with Discrete Kirchhoff Triangles
- A shape preserving representation with an evaluation algorithm of linear complexity
- From Shapes to Amortized Complexity
This page was built for publication: Structured discrete shape approximation: theoretical complexity and practical algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824342)
