A linear-time near-optimum-length triangulation algorithm for convex polygons

Linear Time Triangulation of Simple Polygons

From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several near-linear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual use despite their faster asymptotic running time. In this paper, I examine the latter of these i...

NOTE A New Linear Algorithm for Intersecting Convex Polygons

An algorithm is presented that computes the intersection of two convex polygons in linear time. The algorithm is fundamentally different from the only known linear algorithms for this problem, due to Shames and Hoey. These algorithms depend on a division of the plane into either angular sectors (Shamos) or parallel slabs (Hoey), and are mildly complex. Our algorithm searches for the intersectio...

A new linear algorithm for intersecting convex polygons

An algorithm is presented that computes the intersection of two convex polygons in linear time. The algorithm is fundamentally different from the only known linear algorithms for this problem, due to Shames and Hoey. These algorithms depend on a division of the plane into either angular sectors (Shamos) or parallel slabs (Hoey), and are mildly complex. Our algorithm searches for the intersectio...

A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons

Chord Length Distribution Function for Convex Polygons

Department of Mathematics and Mechanics, Yerevan State University, Alex Manoogian, 1 0025 Yerevan, Armenia. [email protected]. Using the inclusion-exclusion principle and the Pleijel identity, an algorithm for calculation chord length distribution function for a bounded convex polygon is obtained. In the particular case an expression for the chord length distribution function for a rhombus is obta...