Visibility of rectagular objects inL1metric

DOI10.1080/00207169808804743MaRDI QIDQ4236100zbMATH OpenOpenAlexWikidataFDO

Authors S. Jeyalakshmi, Kamala Krithivasan

Publication date 22 March 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169808804743

zbMATH Keywords

computational complexitycomputational geometryobject modellingvisibility algorithmsvisibility of geometric objects

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Descriptive geometry (51N05)

Recommendations

• On rectangular visibility
• An optimal algorithm for reporting visible rectangles
• scientific article; zbMATH DE number 1182918
• scientific article; zbMATH DE number 177568

Cites work

• Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
• Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
• Priority Search Trees
• Visibility with a moving point of view

Cited in

(1)

• On rectangular visibility

This page was built for publication: Visibility of rectagular objects inL₁metric

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