Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COMGEO
2010
ACM

favoriteEmaildiscussreport

143views Applied Computing» more COMGEO 2010»

Computing the visibility map of fat objects

13 years 2 months ago

Computing the visibility map of fat objects

Download alexandria.tue.nl

Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm runs in O((n + k) polylog n) time, where k is the combinatorial complexity of the visibility map. This is the first algorithm for computing the visibility map of fat objects that does not require a depth order on the objects and is faster than the best known algorithm for general objects. It is also the first output-sensitive algorithm for curved objects that does not require a depth order.

Mark de Berg, Chris Gray

Real-time Traffic

Algorithm | Applied Computing | COMGEO 2010 | Output-sensitive Algorithm | Visibility Map |

claim paper

Related Content

» Visibility maps of realistic terrains have linear smoothed complexity

» Visibility of Point Clouds and Mapping of Unknown Environments

» Sample Based Visibility for Soft Shadows using Aliasfree Shadow Maps

» Visibility map for global illumination in point clouds

» Soft Shadow Maps Efficient Sampling of Light Source Visibility

» Reducing mismatching under timepressure by reasoning about visibility and occlusion

» Visibility based methods and assessment for detailrecovery

» Fast Visibility Restoration from a Single Color or Gray Level Image

» Qualitative Map Learning Based on Covisibility of Objects

Post Info
More Details (n/a)

Added	01 Feb 2011
Updated	01 Feb 2011
Type	Journal
Year	2010
Where	COMGEO
Authors	Mark de Berg, Chris Gray

Comments (0)