2009 International Conference on Information Technology and Computer Science 2009
DOI: 10.1109/itcs.2009.221
View full text
|
Sign up to set email alerts
|

Abstract: Orientation of polygon, convexity or concavity of vertices and point inclusion test are three fundamental problems in geometry. In this paper, a novel method to identify the orientation of a triangle using its extreme vertex order is proposed. The orientation of a polygon can be determined by a triangle which is composed of an extreme vertex and its two adjacent vertices. It determines the convexity-concavity of the vertex whether the orientation of polygon is same as the orientation of a triangle which is com… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
(6 reference statements)
0
1
0
Order By: Relevance
“…Algorithms for the concavity-convexity detection of vertices of spatial objects are the basis of many graphics algorithms, including test algorithms [1][2][3][4][5], orientation and convexity-concavity determination algorithm for simple polygons [6,7], and computer graphics processing [8,9]. The commonly used vertex concavity-convexity detection algorithms for polygons include the convex hulls [10], angle [11], left-right-point [12], vector area [13], cross product [14], slope [15], and extremity vertices sequence methods [16].…”
Section: Introductionmentioning
confidence: 99%
“…Algorithms for the concavity-convexity detection of vertices of spatial objects are the basis of many graphics algorithms, including test algorithms [1][2][3][4][5], orientation and convexity-concavity determination algorithm for simple polygons [6,7], and computer graphics processing [8,9]. The commonly used vertex concavity-convexity detection algorithms for polygons include the convex hulls [10], angle [11], left-right-point [12], vector area [13], cross product [14], slope [15], and extremity vertices sequence methods [16].…”
Section: Introductionmentioning
confidence: 99%