Determining Front-Facing Polygons for Dynamic and Deformable Objects
Summary :
In this paper, we present a simple and practical method for determining the front-facing polygons for static, dynamic, and deformable objects. The object space is considered a set of open-frustum regions. A bit string associated with each region records polygons for their extended positive half space intersecting the corresponding region. For a given viewpoint, the bit string of the set of the front facing polygons can be determined in a constant time. While objects continuously keep deforming and/or remain in motion in each frame, we update set of bit strings, determined as minimal as possible by the spatial coherence, making our method still perform efficiently.
- Publication
- IEICE TRANSACTIONS on Information Vol.E88-D No.5 pp.1050-1059
- Publication Date
- 2005/05/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietisy/e88-d.5.1050
- Type of Manuscript
- PAPER
- Category
- Computer Graphics
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hsien-Hsi HSIEH, Wen-Kai TAI, "Determining Front-Facing Polygons for Dynamic and Deformable Objects" in IEICE TRANSACTIONS on Information,
vol. E88-D, no. 5, pp. 1050-1059, May 2005, doi: 10.1093/ietisy/e88-d.5.1050.
Abstract: In this paper, we present a simple and practical method for determining the front-facing polygons for static, dynamic, and deformable objects. The object space is considered a set of open-frustum regions. A bit string associated with each region records polygons for their extended positive half space intersecting the corresponding region. For a given viewpoint, the bit string of the set of the front facing polygons can be determined in a constant time. While objects continuously keep deforming and/or remain in motion in each frame, we update set of bit strings, determined as minimal as possible by the spatial coherence, making our method still perform efficiently.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e88-d.5.1050/_p
Copy
@ARTICLE{e88-d_5_1050,
author={Hsien-Hsi HSIEH, Wen-Kai TAI, },
journal={IEICE TRANSACTIONS on Information},
title={Determining Front-Facing Polygons for Dynamic and Deformable Objects},
year={2005},
volume={E88-D},
number={5},
pages={1050-1059},
abstract={In this paper, we present a simple and practical method for determining the front-facing polygons for static, dynamic, and deformable objects. The object space is considered a set of open-frustum regions. A bit string associated with each region records polygons for their extended positive half space intersecting the corresponding region. For a given viewpoint, the bit string of the set of the front facing polygons can be determined in a constant time. While objects continuously keep deforming and/or remain in motion in each frame, we update set of bit strings, determined as minimal as possible by the spatial coherence, making our method still perform efficiently.},
keywords={},
doi={10.1093/ietisy/e88-d.5.1050},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Determining Front-Facing Polygons for Dynamic and Deformable Objects
T2 - IEICE TRANSACTIONS on Information
SP - 1050
EP - 1059
AU - Hsien-Hsi HSIEH
AU - Wen-Kai TAI
PY - 2005
DO - 10.1093/ietisy/e88-d.5.1050
JO - IEICE TRANSACTIONS on Information
SN -
VL - E88-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2005
AB - In this paper, we present a simple and practical method for determining the front-facing polygons for static, dynamic, and deformable objects. The object space is considered a set of open-frustum regions. A bit string associated with each region records polygons for their extended positive half space intersecting the corresponding region. For a given viewpoint, the bit string of the set of the front facing polygons can be determined in a constant time. While objects continuously keep deforming and/or remain in motion in each frame, we update set of bit strings, determined as minimal as possible by the spatial coherence, making our method still perform efficiently.
ER -
English
