ConvexPolygon
Section: C Library Functions (3)
Updated: IRIT Version 6.0
Index
Return to Main Contents
NAME
ConvexPolygon()
SYNOPSIS
geom_lib/convex.c:246
int ConvexPolygon(IPPolygonStruct *Pl)
DESCRIPTION
Routine to test if the given polygon is convex or not.
Algorithm: The polygon is convex iff the normals generated from cross
products of two consecutive edges points to the same direction.
Note a 5 star polygon satisfies this constraint but it is self
intersectingand we assume given polygon is not selft intersecting.
The computed direction is alos verified against the polygon's plane
normal.
The routine returns TRUE iff the polygon is convex. In addition the
polygon CONVEX tag (see IPPolygonStruct) is also updated.
If the polygon is already marked as convex, nothing is tested!
PARAMETERS:
Pl: To test its convexity condition.
FUNCTION RETURN VALUE
int: TRUE if convex, FALSE otherwise.
ORIGIN
(C) Copyright 1989/90-95 Gershon Elber, Technion, IIT
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- PARAMETERS:
-
- FUNCTION RETURN VALUE
-
- ORIGIN
-
This document was created by
man2html,
using the manual pages.
Time: 07:28:21 GMT, July 20, 2024