Predicates of the 3D Apollonius Diagram
Manos Kamarianakis

TL;DR
This paper analyzes the EDGECONFLICT predicate essential for constructing the 3D Apollonius diagram, focusing on minimizing algebraic complexity and providing detailed algorithmic and algebraic analysis for both non-degenerate and degenerate cases.
Contribution
It introduces an optimized algebraic degree analysis of the EDGECONFLICT predicate, including decomposition into sub-predicates and evaluation strategies using inversion and perturbation techniques.
Findings
Maximum algebraic degree is 10 in non-degenerate cases.
Sub-predicates can be evaluated with degree 8 or 10 operations.
Analysis is primarily conducted in inverted space for geometric insights.
Abstract
In this thesis we study one of the fundamental predicates required for the construction of the 3D Apollonius diagram (also known as the 3D Additively Weighted Voronoi diagram), namely the EDGECONFLICT predicate: given five sites that define an edge in the 3D Apollonius diagram, and a sixth query site , the predicate determines the portion of that will disappear in the Apollonius diagram of the six sites due to the insertion of . Our focus is on the algorithmic analysis of the predicate with the aim to minimize its algebraic degree. We decompose the main predicate into sub-predicates, which are then evaluated with the aid of additional primitive operations. We show that the maximum algebraic degree required to answer any of the sub-predicates and primitives, and, thus, our main predicate is 10 in non-degenerate configurations when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Computer Graphics and Visualization Techniques
