Abstract

Let V be a set of objects in space for which we want to determine the portions visible from a particular point of view υ. Assume V is subdivided in subsets V1,…, Vz and the visibility maps Μ1, … Μz of these subsets from point ugr; are known. We show that the visibility map Μ for V can be computed by merging Μ1, … Μz in time Ο((n + κ)z log2 n) where n is the total size (number of edges, vertices and faces) of the visibility maps Μ1,…, Μz and κ is the size of Μ.

Keywords:
Visibility Point (geometry) Set (abstract data type) Combinatorics Visibility graph Mathematics Space (punctuation) Computer science Physics Geometry Optics

Metrics

4
Cited By
0.85
FWCI (Field Weighted Citation Impact)
19
Refs
0.71
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Computational Geometry and Mesh Generation
Physical Sciences →  Computer Science →  Computer Graphics and Computer-Aided Design
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Robotic Path Planning Algorithms
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition

Related Documents

JOURNAL ARTICLE

Merging visibility maps

Mark H. OvermarsMicha Sharir

Journal:   Computational Geometry Year: 1991 Vol: 1 (1)Pages: 35-49
JOURNAL ARTICLE

Fringe Visibility Maps

P. FraundorfWentao Qin

Journal:   Microscopy and Microanalysis Year: 2001 Vol: 7 (S2)Pages: 272-273
BOOK-CHAPTER

Merging Partially Consistent Maps

Taigo Maria BonanniGiorgio GrisettiLuca Iocchi

Lecture notes in computer science Year: 2014 Pages: 352-363
JOURNAL ARTICLE

Good-visibility maps visualization

Narcís CollNarcís MadernJ. Antoni Sellarès

Journal:   The Visual Computer Year: 2009 Vol: 26 (2)Pages: 109-120
© 2026 ScienceGate Book Chapters — All rights reserved.