An efficient local approach to convexity testing of piecewise-linear hypersurfaces

DOI10.1016/j.comgeo.2008.02.004zbMath1160.65008OpenAlexW2148898632MaRDI QIDQ955229

K. A. jun. Rybnikov

Publication date: 19 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.02.004

zbMATH Keywords

algorithmconvexitycomputational efficiencyprogram checkingpolyhedral surfacecomputational topologypiecewise-linear surfacegeometric property testingoutput verification

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

Certifying algorithms ⋮ Many projectively unique polytopes

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyedrische 2-Mannigfaltigkeiten mit wenigen nichtkonvexen Ecken
• Checking the convexity of polytopes and the planarity of subdivisions
• Checking geometric programs or verification of geometric structures
• Using generic programming for designing a data structure for polyhedral surfaces
• How good are convex hull algorithms?
• A derivative-coderivative inclusion in second-order nonsmooth analysis
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry
• Convex hulls, oracles, and homology
• Designing programs that check their work
• Locally Convex Hypersurfaces
• On locally convex manifolds

This page was built for publication: An efficient local approach to convexity testing of piecewise-linear hypersurfaces