Inclusion test for general polyhedra

被引：75

作者：

Feito, FR ^{[1
]}

Torres, JC ^{[1
]}

机构：

[1] UNIV GRANADA,DEPT LENGUAJES & SISTEMAS INFORMAT,GRANADA,SPAIN

来源：

COMPUTERS & GRAPHICS | 1997年 / 21卷 / 01期

关键词：

D O I：

10.1016/S0097-8493(96)00067-2

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper presents a new algorithm which tests the inclusion of a point in a general polyhedron, manifold and non-manifold, without solving any equation system and without using trigonometric functions. The algorithm is simple and robust, and easy to apply in every case. (C) 1997 Elsevier Science Ltd.

引用

页码：23 / 30

页数：8

共 8 条

[1]

Berger M., 1987, Geometry, VI

[2] ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS [J].

FEITO, F ;

TORRES, JC ;

URENA, A .

COMPUTERS & GRAPHICS, 1995, 19 (04) :595-600

[3]

FEITO F, 1995, THESIS U GRANADA GRA

[4] A THEOREM TO DETERMINE THE SPATIAL CONTAINMENT OF A POINT IN A PLANAR POLYHEDRON [J].

HORN, WP ;

TAYLOR, DL .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1989, 45 (01) :106-116

[5]

KALAY YE, 1982, COMPUTER GRAPHICS IM, V19, P203

[6] AN EFFICIENT POINT IN POLYHEDRON ALGORITHM [J].

LANE, J ;

MAGEDSON, B ;

RARICK, M .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 26 (01) :118-125

[7]

OROURQUE J, 1994, COMPUTATIONAL GEOMET

[8]

PREPRARATA FP, 1985, COMPUTATIONAL GEOMET

← 1 →