Counting and cutting cycles of lines and rods in space
type: Item
instance of: scholarly article
title: Counting and cutting cycles of lines and rods in space
zbMATH Open document ID: 0748.68082
DOI: 10.1016/0925-7721(92)90009-H
author: Bernard Chazelle
author: Leonidas Guibas
author: Richard Pollack
author: Raimund Seidel
author: Micha Sharir
author: Herbert Edelsbrunner
author: Jack Snoeyink
published in: Computational Geometry
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 64216
zbMATH Keywords: hidden surface removal
zbMATH Keywords: depth sort
zbMATH Keywords: line segments
zbMATH Keywords: incidences
zbMATH Keywords: rendering algorithms
zbMATH Keywords: three-dimensional objects
zbMATH Keywords: cycle
Wikidata QID: Q56970893
MaRDI profile type: Publication
cites work: Q3852212
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains
cites work: Lines in space: Combinatorics and algorithms
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Q3772828
cites work: Q3219751
cites work: Q3219752
cites work: Q3138883
cites work: Q4756008
cites work: Extremal problems in discrete geometry
cites work: Q3711242
cites work: Rigidity and polarity. II: Weaving lines and tensegrity frameworks
full work available at URL: 0925-7721(92)90009-h
OpenAlex ID: W2010761427
DBLP publication ID: journals/comgeo/ChazelleEGPSSS91
description: scientific article; zbMATH DE number 64216