ORIENTATION, SIMPLICITY, AND INCLUSION TEST FOR PLANAR POLYGONS

被引:81
作者
FEITO, F
TORRES, JC
URENA, A
机构
[1] UNIV GRANADA,ETSI INFORMAT,DEPT LENGUAJES & SISTEMAS INFORMAT,E-18071 GRANADA,SPAIN
[2] UNIV JAEN,DEPT INFORMAT,JAEN,SPAIN
关键词
D O I
10.1016/0097-8493(95)00037-D
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a collection of robust and simple algorithms to decide the orientation, simplicity, and inclusion of planar polygons, without solving any equation systems and without using trigonometric functions.
引用
收藏
页码:595 / 600
页数:6
相关论文
共 6 条
[1]  
Balbes R., 1991, Computer-Aided Geometric Design, V8, P327, DOI 10.1016/0167-8396(91)90019-8
[2]  
Foley J. D., 1990, COMPUTER GRAPHICS PR
[3]  
Guibas L., 1983, 24th Annual Symposium on Foundations of Computer Science, P100, DOI 10.1109/SFCS.1983.1
[4]  
Hilbert D., 1930, GRUNDLAGEN GEOMETRIE, V7
[5]  
Kalay Y.E., 1989, MODELLING OBJECTS EN
[6]  
Preparata F. P., 2012, COMPUTATIONAL GEOMET