Counting and cutting cycles of lines and rods in space

DOI10.1016/0925-7721(92)90009-HzbMATH Open0748.68082DBLPjournals/comgeo/ChazelleEGPSSS91OpenAlexW2010761427WikidataQ56970893 ScholiaQ56970893MaRDI QIDQ1194306FDOQ1194306

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

Recommendations

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

zbMATH Keywords

cycleline segmentsincidenceshidden surface removaldepth sortrendering algorithmsthree-dimensional objects

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal problems in discrete geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• An optimal algorithm for intersecting line segments in the plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lines in space: Combinatorics and algorithms
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Rigidity and polarity. II: Weaving lines and tensegrity frameworks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

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

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)