Point Containment in Discrete Arbitrary Dimension

Author

Silva, Luciano

Author_Institution

Dept. of Comput. Sci., Univ. Presbiteriana Mackenzie, Sao Paulo

fYear

2006

fDate

14-16 June 2006

Firstpage

350

Lastpage

357

Abstract

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.

Keywords

computational complexity; computational geometry; computer graphics; data structures; anti-aliasing; arbitrary dimension discrete object; computational complexity; computer graphics; data structure; filling process; generalized point containment algorithm; geometric modeling; raster calculation; stroking process; volume rendering; Buildings; Computer graphics; Computer science; Data structures; Filling; Geometry; Hardware; Rendering (computer graphics); Shape; Solid modeling;

fLanguage

English

Publisher

ieee

Conference_Titel

3D Data Processing, Visualization, and Transmission, Third International Symposium on

Conference_Location

Chapel Hill, NC

Print_ISBN

0-7695-2825-2

Type

conf

DOI

10.1109/3DPVT.2006.108

Filename

4155747