Counting and cutting cycles of lines and rods in space

DOI10.1016/0925-7721(92)90009-HMaRDI QIDQ1194306zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bernard Chazelle, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Herbert Edelsbrunner, Jack Snoeyink

Publication date 27 September 1992

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(92)90009-h

zbMATH Keywords

cycledepth sorthidden surface removalincidencesline segmentsrendering algorithmsthree-dimensional objects

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Cutting triangular cycles of lines in space
• Cutting triangular cycles of lines in space
• Lines in space: Combinatorics and algorithms

Cites work

• Algorithms for bichromatic line-segment problems and polyhedral terrains
• An optimal algorithm for intersecting line segments in the plane
• Combinatorial complexity bounds for arrangements of curves and spheres
• Extremal problems in discrete geometry
• scientific article; zbMATH DE number 432755 (Why is no real title available?)
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3940111 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3012556 (Why is no real title available?)
• Lines in space: Combinatorics and algorithms
• Rigidity and polarity. II: Weaving lines and tensegrity frameworks

Cited in

(25)

• The shortest watchtower and related problems for polyhedral terrains
• Efficient hidden surface removal for objects with small union size
• Efficient ray shooting and hidden surface removal
• On joints in arrangements of lines in space and related problems
• Book review of: L. Guth, Polynomial methods in combinatorics
• Lines in space: Combinatorics and algorithms
• Algebraic methods in discrete analogs of the Kakeya problem
• Joints of varieties
• Eliminating depth cycles among triangles in three dimensions
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
• Weaving patterns of lines and line segments in space
• On lines, joints, and incidences in three dimensions
• Non-transversal multilinear duality and joints
• The joints problem for matroids
• On the Erdős distinct distances problem in the plane
• Counting multijoints
• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
• Joints formed by lines and a k-plane, and a discrete estimate of Kakeya type
• On lines and joints
• Joints tightened
• Kruskal-Katona-type problems via the entropy method
• Partitioning theorems for sets of semi-Pfaffian sets, with applications
• On the multilinear restriction and Kakeya conjectures
• Incidence bounds on multijoints and generic joints

This page was built for publication: Counting and cutting cycles of lines and rods in space

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