Approximate medial axis as a Voronoi subcomplex
نویسندگان
چکیده
منابع مشابه
Approximate Voronoi Diagrams
A Voronoi diagram of a point set P ⊆ IR is a partition of space into regions, such that the cell of p ∈ P , is V (p, P ) = { x ∣∣∣‖xp‖ ≤‖xp′‖ for all p′ ∈ P }. Vornoi diagrams are a powerful tool and have numerous applications [Aur91]. One problem with Vornoi diagrams is that their descriptive complexity is O(ndd/2e) in IR, in the worst case. See Figure 1 for an exmaple in three dimensions. It ...
متن کاملA Voronoi based Labeling Approach to Curve Reconstruction and Medial Axis Approximation
In this paper, we present a Voronoi based algorithm for closed curve reconstruction and medial axis approximation from planar points. In principle, the algorithm estimates one of the poles (farthest Voronoi vertices of a Voronoi cell) and hence the normals at each sample point by drawing an analogy between a residential water distribution system and Voronoi diagram of input samples. The algorit...
متن کاملEfficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron
AVNEESH SUD: Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron. (Under the direction of Dinesh Manocha.) The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the ...
متن کاملMedial Axis Approximation with Constrained Centroidal Voronoi Diagrams On Discrete Data
In this paper, we present a novel method for medial axis approximation based on Constrained Centroidal Voronoi Diagram of discrete data (image, volume). The proposed approach is based on the shape boundary subsampling by a clustering approach which generates a Voronoi Diagram well suited for Medial Axis extraction. The resulting Voronoi Diagram is further filtered so as to capture the correct t...
متن کاملVoronoi diagram and medial axis algorithm for planar domains with curved boundaries — II: Detailed algorithm description
Details of algorithms to construct the Voronoi diagrams and medial axes of planars domain bounded by free-form (polynomial or rational) curve segments are presented, based on theoretical foundations given in the rst installment Ramamurthy and Farouki, J. Comput. Appl. Math. (1999) 102 119–141 of this two-part paper. In particular, we focus on key topological and computational issues that arise ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design
سال: 2004
ISSN: 0010-4485
DOI: 10.1016/s0010-4485(03)00061-7