CCCG 2003 - PDF Preprint Papers

CCCG 2003

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CCCG-2003 Paper

click to vote

CCCG
2003

144views Computational Geometry» more CCCG 2003»

An algorithm for the MaxMin area triangulation of a convex polygon

14 years 24 days ago

Download web.cs.dal.ca

Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...

J. Mark Keil, Tzvetalin S. Vassilev

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	144	An algorithm for the MaxMin area triangulation of a convex polygon	claim
2	140	On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation	claim
3	135	Computing the Closest Point to a Circle	claim
4	132	A combinatorial maximum cover approach to 2D translational geometric covering	claim
5	126	The Strange Complexity of Constrained Delaunay Triangulation	claim
6	122	Decomposing Polygons Into Diameter Bounded Components	claim
7	121	Transversals to line segments in R3	claim
8	118	Encoding Quadrilateral Meshes	claim
9	117	On shortest paths in line arrangements	claim
10	116	Degree Bounds for Constrained Pseudo-Triangulations	claim
11	113	The Gaussian Centre of a Set of Mobile Points	claim
12	112	Shortest Paths in Two Intersecting Pencils of Lines	claim
13	109	Linear Binary Space Partitions and the Hierarchy of Object Classes	claim
14	104	Equiprojective Polyhedra	claim
15	100	Partitioning Regular Polygons into Circular Pieces I: Convex Partitions	claim
16	100	Triangle Guarding	claim
17	99	Network Design Subject to Facility Location	claim
18	98	On the Number of Pseudo-Triangulations of Certain Point Sets	claim
19	96	Multidimensional Orthogonal Range Search Using Tries	claim
20	96	Curves of width one and the river shore problem	claim
21	93	Estimation of the necessary number of points in Riemannian Voronoi	claim
22	92	On the Complexity of Halfspace Volume Queries	claim
23	89	Approximating the geometric minimum-diameter spanning tree	claim
24	85	On Polyhedra Induced by Point Sets in Space	claim
25	83	Hinged Dissection of Polygons is Hard	claim
26	77	Planar case of the maximum box and related problems	claim
27	75	Coloring Objects Built From Bricks	claim
28	74	Computing Delaunay Triangulation with Imprecise Input Data	claim
29	68	On the worst-case complexity of the silhouette of a polytope	claim
30	62	Parallel morphing of trees and cycles	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers