Point in solid strategies

被引：29

作者：

Ogayar, CJ ^{[1
]}

Segura, RJ ^{[1
]}

Feito, FR ^{[1
]}

机构：

[1] Univ Jaen, Dept Informat, Jaen 23071, Spain

来源：

COMPUTERS & GRAPHICS-UK | 2005年 / 29卷 / 04期

关键词：

inclusion test; solid modeling; boundary representation; geometric algorithms; computer graphics;

D O I：

10.1016/j.cag.2005.05.012

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Testing whether a point is inside a solid is a basic operation in computer graphics. This document presents a variety of strategies for triangle meshes, a widely used data structure in computer graphics. We discuss some issues about the capabilities of each approach depending on the situation, taking into account memory and CPU usage. A practical comparison of the performance of several strategies is also presented, with implementation issues and time tables showing the performance of each algorithm. The tests highlight the strengths and weaknesses of each approach. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：616 / 624

页数：9

共 23 条

[1] Abrash Michael, 1997, Michael Abrashs graphics programming black book
[2] [Anonymous], 1989, The Design and Analysis of Spatial Data Structures
[3] Badouel D., 1990, EFFICIENT RAY POLYGO, P390, DOI [10.1016/B978-0-08-050753-8.50082-6, DOI 10.1016/B978-0-08-050753-8.50082-6]
[4] SOLID REPRESENTATION AND OPERATION USING EXTENDED OCTREES
BRUNET, P
NAVAZO, I
[J]. ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (02): : 170 - 197
[5] ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS
FEITO, F
TORRES, JC
URENA, A
[J]. COMPUTERS & GRAPHICS, 1995, 19 (04) : 595 - 600
[6] Inclusion test for general polyhedra
Feito, FR
Torres, JC
[J]. COMPUTERS & GRAPHICS, 1997, 21 (01) : 23 - 30
[7] FEITO FR, 1998, CSG98 SET THEORETICA, V96, P239
[8] Fuchs H., 1980, Computer Graphics, V14, P124, DOI 10.1145/965105.807481
[9] Gargantini I., 1993, Computer Graphics Forum, V12, P199, DOI 10.1111/1467-8659.1240199
[10] GLASSNER A, 1989, INTRO RAY TRACING, P217

← 1 2 3 →