Vertical decompositions for triangles in 3-space
type: Item
instance of: scholarly article
title: Vertical decompositions for triangles in 3-space
zbMATH Open document ID: 0840.68116
DOI: 10.1007/BF02716578
author: Leonidas Guibas
author: Dan Halperin
author: Mark de Berg
published in: Discrete \& Computational Geometry
publication date: 1996-02-13T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 844115
zbMATH Keywords: vertical decomposition
zbMATH Keywords: combinatorial complexity
MaRDI profile type: Publication
cites work: Ray Shooting and Parametric Search
cites work: On range searching with semialgebraic sets
cites work: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
cites work: Triangles in space or building (and analyzing) castles in the air
cites work: Castles in the air revisited
cites work: Algorithms for Reporting and Counting Geometric Intersections
cites work: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
cites work: Cutting hyperplanes for divide-and-conquer
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Q3481216
cites work: A deterministic view of random sampling and its use in geometry
cites work: Fractional cascading. I: A data structuring technique
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Applications of random sampling in computational geometry. II
cites work: Ray shooting, depth orders and hidden surface removal
cites work: On lazy randomized incremental construction
cites work: Efficient ray shooting and hidden surface removal
cites work: The upper envelope of piecewise linear functions: Tight bounds on the number of faces
cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Q4011313
cites work: Finding the upper envelope of n line segments in O(n log n) time
cites work: Range searching with efficient hierarchical cuttings
cites work: Q3992847
cites work: Efficient Point Location in a Convex Spatial Cell-Complex
cites work: Almost tight upper bounds for lower envelopes in higher dimensions
cites work: Planar realizations of nonlinear Davenport-Schinzel sequences by segments
full work available at URL: https://doi.org/10.1007/bf02716578
OpenAlex ID: W1993965377
Recommended article: Triangle decompositions
Recommended article: Improved construction of vertical decompositions of three-dimensional arrangements
Recommended article: Triangle decompositions of planar graphs
Recommended article: Q3795683
Recommended article: Trinal Decompositions of Steiner Triple Systems into Triangles
Recommended article: Triangular Dissections of N-Gons
Recommended article: Q5188269
Recommended article: Decomposition and Enumeration of Triangulated Surfaces
Recommended article: On decomposition of 3-polyhedra into a Cartesian product
Recommended article: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
description: scientific article; zbMATH DE number 844115