Removing depth-order cycles among triangles: an algorithm generating triangular fragments

DOI10.1007/S00454-019-00102-0zbMATH Open1474.68418arXiv1701.00679OpenAlexW2945387729MaRDI QIDQ2225657FDOQ2225657

Authors: Mark de Berg 

Publication date: 10 February 2021

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: More than 25 years ago Chazelle~emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${BbbR}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth order? They proved an $O(n^{9/4})$ bound for the very special case of bipartite weavings of lines. Since then only little progress was made, until a recent breakthrough by Aronov and Sharir (STOC 2016) who showed that $O(n^{3/2}mathrmpolylog;n)$ fragments suffice for any set of lines. In a follow-up paper Aronov, Miller and Sharir (SODA 2017) proved an $O(n^{3/2+varepsilon})$ bound for triangles, but their method results in pieces with curved boundaries. Moreover, their method uses polynomial partitions, for which currently no algorithm is known. Thus the most natural version of the problem is still wide open: Can we cut any collection of $n$ disjoint triangles in ${BbbR}^3$ into a subquadratic number of triangular fragments that admit a depth order? And if so, can we compute the cuts efficiently? We answer this question by presenting an algorithm that cuts any set of $n$ disjoint triangles in ${BbbR}^3$ into $O(n^{7/4}mathrmpolylog;n)$ triangular fragments that admit a depth order. The running time of our algorithm is $O(n^{3.69})$. We also prove a refined bound that depends on the number, $K$, of intersections between the projections of the triangle edges onto the $xy$-plane: we show that $O(n^{1+varepsilon}+n^{1/4}{K}^{3/4}mathrmpolylog;n)$ fragments suffice to obtain a depth order. This result extends to $xy$-monotone surface patches bounded by a constant number of bounded-degree algebraic arcs, constituting the first subquadratic bound for surface patches. As a byproduct of our approach we obtain a faster algorithm to cut a set of lines into $O(n^{3/2}mathrmpolylog;n)$ fragments that admit a depth order.

Full work available at URL: https://arxiv.org/abs/1701.00679

Recommendations

• Eliminating depth cycles among triangles in three dimensions
• Eliminating depth cycles among triangles in three dimensions
• Cutting triangular cycles of lines in space
• Cutting triangular cycles of lines in space

zbMATH Keywords

cycle eliminationdepth orderspainter's algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Computational geometry. Algorithms and applications.
• CUTTINGS AND APPLICATIONS
• Cutting hyperplanes for divide-and-conquer
• Ray shooting, depth orders and hidden surface removal
• Computing and Verifying Depth Orders
• Range searching with efficient hierarchical cuttings
• Linear size binary space partitions for uncluttered scenes
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Counting and cutting cycles of lines and rods in space
• Binary Space Partitions for Axis-Aligned Fat Rectangles
• Optimal binary space partitions for orthogonal objects
• Binary Space Partitions for Fat Rectangles
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Title not available (Why is that?)
• Polynomial partitioning for a set of varieties
• Cutting algebraic curves into pseudo-segments and applications
• Computing depth orders for fat objects and related problems
• Title not available (Why is that?)
• Eliminating depth cycles among triangles in three dimensions
• Cutting triangular cycles of lines in space
• Online point location in planar arrangements and its applications
• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications

Cited In (1)

• Eliminating depth cycles among triangles in three dimensions

This page was built for publication: Removing depth-order cycles among triangles: an algorithm generating triangular fragments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225657)