Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. (August 2016)

• Record Type: Journal Article
• Authors: Bennett, H.; Papadopoulou, E.; Yap, C.
• Is Part Of: Computer graphics forum. Volume 35:Number 5(2016)
• Page Start: 229
• Page End: 247
• Publication Date: 2016-08
• Subjects: Categories and Subject Descriptors (according to ACM CCS) -- I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms -- F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Geometrical problems and computations -- G.1.0 [Numerical Analysis]: General—Interval arithmetic -- G.1.2 [Numerical Analysis]: Approximation—Approximation of surfaces and contours -- G.4 [Mathematical Software]: —Algorithm design and analysis; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.12979
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: Let X = {f1, …, fn } be a set of scalar functions of the form fi : ℝ 2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X. By exploiting soft predicates and clustering of Voronoi vertices, our algorithm is the first that can handle arbitrary degeneracies in X, and allow scalar functions which are piecewise smooth, and not necessarily semi‐algebraic. We apply these ideas to the computation of anisotropic Voronoi diagram of polygonal sets; this is a natural generalization of anisotropic Voronoi diagrams of point sites, which extends multiplicatively weighted Voronoi diagrams. We implement a prototype of our anisotropic algorithm and provide experimental results.