An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum

DOI10.1007/BF01759047MaRDI QIDQ2639639zbMATH OpenOpenAlexFDO

Authors Panagiotis D. Alevizos, Jean-Daniel Boissonnat, F. P. Preparata

Publication date 1991

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01759047

zbMATH Keywords

combinatorial geometrycomputational geometryunion of half-lines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An optimal algorithm for the boundary of a cell in a union of rays
• scientific article; zbMATH DE number 3804872
• Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines
• A fast planar partition algorithm, II
• Corrigendum: Topologically sweeping an arrangement

Cites work

• An optimal algorithm for the boundary of a cell in a union of rays

Cited in

(2)

• Corrigendum: Topologically sweeping an arrangement
• An optimal algorithm for the boundary of a cell in a union of rays

This page was built for publication: An optimal algorithm for the boundary of a cell in a union of rays - Corrigendum

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