Structured discrete shape approximation: theoretical complexity and practical algorithm

DOI10.1016/J.COMGEO.2021.101795MaRDI QIDQ824342zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitymixed-integer programmingshape approximationdiscrete assembly systemszometool

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1424291
• Computation of generalized convex approximations of planar geometric objects
• scientific article; zbMATH DE number 742976
• Separation and approximation of polyhedral objects

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256695 (Why is no real title available?)
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Computing minimum length paths of a given homotopy class
• Mapping polygons to the grid with small Hausdorff and Fréchet distance
• Minimum-link paths among obstacles in the plane
• Minimum-link paths revisited
• Minimum-perimeter enclosures
• ON GEOMETRIC PATH QUERY PROBLEMS
• On the complexity of minimum-link path problems
• OpenFlipper: an open source geometry processing and rendering framework
• Surface Approximation and Geometric Partitions

Cited in

(5)

• Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm
• 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
• An O(N log N) algorithm for shape modeling.

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)