Sciweavers

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

13

CAD
2007
Springer

favoriteEmaildiscussreport

132views Theoretical Computer Science» more CAD 2007»

The spherical visibility map

13 years 4 months ago

The spherical visibility map

Download www.dgp.toronto.edu

We introduce a novel representation for visibility in three dimensions and describe an efﬁcient algorithm to construct it. The data structure is a spherical map that consists of a doubly–connected edge list embedded on the surface of a sphere. Each face of the spherical map is labeled with the polygon visible in the corresponding cone. We demonstrate that the algorithm is efﬁcient and robust by showing statistics of its time and space requirements for handling several classes of input.

Todd Keeler, John Fedorkiw, Sherif Ghali

Real-time Traffic

CAD 2007 | Doubly–connected Edge List | Efﬁcient Algorithm | Spherical Map | Theoretical Computer Science |

claim paper

Related Content

» A new upsampling method for mobile LiDAR data

» Hardwareassisted Viewdependent Isosurface Extraction using Spherical Partition

» Conformal spherical representation of 3D genuszero meshes

» ImageBased Proxy Accumulation for RealTime Soft Global Illumination

» Texture Mapping via Spherical Multidimensional Scaling

» RealTime Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights

» Analyzing Domestic Violence with Topographic Maps A Comparative Study

» Fast Soft SelfShadowing on Dynamic Height Fields

» ScreenCamera Calibration Using Gray Codes

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	CAD
Authors	Todd Keeler, John Fedorkiw, Sherif Ghali

Comments (0)