loading...
Point Containment in Discrete Arbitrary Dimension
University of North Carolina, Chapel Hill, USA June 14-June 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/3DPVT.2006.108Third International Symposium on 3D D ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Luciano Silva, Universidade Mackenzie, Brazil
The point containment predicate which specifies if a point is part of a mathematically defined shape is one of the most elementary operations in computer graphics and is a natural way to perform the many raster calculations. It plays an essential role in several important processes such as filling, stroking, anti-aliasing, geometric modeling and volume rendering. This paper presents a generalized point containment algorithm for arbitrary dimension discrete objects whose main characteristics are low complexity, simple data structures and suitability for hardware implementation.
Citation:
Luciano Silva, "Point Containment in Discrete Arbitrary Dimension," 3dpvt, pp.350-357, Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.