Vertical decompositions for triangles in 3-space
From MaRDI portal
Publication:1907609
DOI10.1007/BF02716578zbMATH Open0840.68116OpenAlexW1993965377MaRDI QIDQ1907609FDOQ1907609
Authors: Leonidas Guibas, Dan Halperin, Mark de Berg 
Publication date: 13 February 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02716578
Recommendations
- Triangle decompositions
- Improved construction of vertical decompositions of three-dimensional arrangements
- Triangle decompositions of planar graphs
- scientific article; zbMATH DE number 4061255
- Trinal decompositions of Steiner triple systems into triangles
- Triangular Dissections of N-Gons
- Intersection formulas and algorithms for computing triangular decompositions
- Decomposition and Enumeration of Triangulated Surfaces
- On decomposition of 3-polyhedra into a Cartesian product
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Applications of random sampling in computational geometry. II
- Title not available (Why is that?)
- A deterministic view of random sampling and its use in geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- Algorithms for Reporting and Counting Geometric Intersections
- Efficient Point Location in a Convex Spatial Cell-Complex
- An optimal algorithm for intersecting line segments in the plane
- On lazy randomized incremental construction
- Finding the upper envelope of n line segments in O(n log n) time
- Almost tight upper bounds for lower envelopes in higher dimensions
- Fractional cascading. I: A data structuring technique
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Cutting hyperplanes for divide-and-conquer
- Ray shooting, depth orders and hidden surface removal
- On range searching with semialgebraic sets
- A Randomized Algorithm for Closest-Point Queries
- Range searching with efficient hierarchical cuttings
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Ray Shooting and Parametric Search
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Triangles in space or building (and analyzing) castles in the air
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces
- Efficient ray shooting and hidden surface removal
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertical decompositions for triangles in 3-space
- Castles in the air revisited
Cited In (15)
- Throwing a sofa through the window
- Cuttings for disks and axis-aligned rectangles in three-space
- Spheres, molecules, and hidden surface removal
- Dynamic motion planning in low obstacle density environments
- Vertical decompositions for triangles in 3-space
- Improved construction of vertical decompositions of three-dimensional arrangements
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces
- Translational packing of arbitrary polytopes
- Dynamic motion planning in low obstacle density environments
- Computing and reducing slope complexes
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
- Triangles in space or building (and analyzing) castles in the air
- Counting and representing intersections among triangles in three dimensions
- Almost tight upper bounds for the single cell and zone problems in the three dimensions
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
This page was built for publication: Vertical decompositions for triangles in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907609)
