ACS Algorithms for Complex Shapes with Certified Numerics and Topology Prototype implementation of certified approximation of the Medial Axis of smooth curves
نویسندگان
چکیده
In this report we give an algorithm to construct an approximate medial axis of a connected domain without any holes, in 2-D, also known as the simply connected domain. The first part of the report concentrates on the algorithm which gives the approximate medial axis of a domain bounded by simple, closed C curve. In the second part of the report we look at a modified version of which looks at domain bounded by splines, which are piecewise C. We report the results of our algorithm for tangent continuous cubic splines which do not have any extremums of the Euclidean curvature at the point of tangency of two splines. Our algorithm uses interval arithmetic to compute the leaf and the branch points. Using simple combinatorial properties of the Medial Axis we guarantee topological correctness of the output.
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Computation of the medial axis of smooth curves with topological guarantees
Project co-funded by the European Commission within FP6 (2002–2006) under contract nr. IST-006413
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Application of algebraic tools to CSG operations on curves and surfaces
متن کامل
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Seed polytopes for incremental approximations of general surfaces in 3D
Approximating a given three-dimensional object in order to simplify its handling is a classical topic in computational geometry and related fields. A typical approach is based on incremental approximation algorithms, which start with a small and topologically correct polytope representation (the seed polytope) of a given sample point cloud or input mesh. In addition, a correspondence between th...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for 3 D problems , related to the topology of implicit
In this work, we propose an algorithm based on subresultants computation to compute the topology of implicit curves defined as intersection of implicit surfaces. Our approach is symbolic-numeric, but certification of the result can be obtained from the simplification of the generic position testing. To check the generic position, our approach treats together a familly of critical points, making...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Algebraic tools for the Voronoi diagram of ellipses, leading to an experimental implementation
We study the four predicates required for the Voronoi diagram of ellipses in the plane, under the Euclidean metric, based on an incremental algorithm. The report concentrates on InCircle, which is the hardest predicate: it decides the position of a query ellipse relative to the Voronoi circle of three given ellipses. The implementation of InCircle combines a certified numeric algorithm with alg...
متن کامل