Point containment in discrete arbitrary dimension

Página do item simplificado
dc.contributor.authorSilva L.
dc.date.accessioned2024-03-13T01:42:57Z
dc.date.available2024-03-13T01:42:57Z
dc.date.issued2006
dc.description.abstractThe 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. © 2006 IEEE.
dc.description.firstpage350
dc.description.lastpage357
dc.identifier.doi10.1109/3DPVT.2006.108
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/37815
dc.relation.ispartofProceedings - Third International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2006
dc.rightsAcesso Restrito
dc.titlePoint containment in discrete arbitrary dimension
dc.typeArtigo de evento
local.scopus.citations0
local.scopus.eid2-s2.0-47249101686
local.scopus.subjectArbitrary dimension
local.scopus.subjectDiscrete objects
local.scopus.subjectElementary operations
local.scopus.subjectGeometric modeling
local.scopus.subjectHardware implementations
local.scopus.subjectPoint containment
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=47249101686&origin=inward
Arquivos
Coleções
Artigo de evento