Most algorithms for polygon triangulation do not consider the quality of generated triangles. Such algorithms tend to generate low-quality mesh characterized by a large number of thin triangles. We present an approach for modifying the ear-cutting triangulation algorithm so that resulting mesh contains higher proportion of quality triangles. We also propose additional method of polygon decomposition that supports higher quality triangulation
Meisters ’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
It remains as one of the major open problems in computational geometry, whether there exists a linea...
Most algorithms for polygon triangulation do not consider the quality of generated triangles. Such a...
We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We pr...
The simple polygon triangulation is an classic problem in computational geometry and the techniques ...
Polygons can conveniently represent real world objects. In automatic character recognition, shapes o...
We show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is...
There are a number of applications for which it is desirable to divide a given region in the plane ...
We present a simple new algorithm for triangulating poly-gons and planar straightline graphs. It pro...
We present an experimental study of different strate-gies for triangulating polygons in parallel. As...
A fundamental algorithmic problem in computer graphics is that of computing a succinct encoding of a...
Skeletonization using the Constrained Delaunay Triangulation technique has proven very effective, wi...
The development of methods for storing, manipulating, and rendering large volumes of data efficientl...
In computer graphics, most polygonal surfaces are rendered via triangles. Rendering a set of triangl...
Meisters ’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
It remains as one of the major open problems in computational geometry, whether there exists a linea...
Most algorithms for polygon triangulation do not consider the quality of generated triangles. Such a...
We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We pr...
The simple polygon triangulation is an classic problem in computational geometry and the techniques ...
Polygons can conveniently represent real world objects. In automatic character recognition, shapes o...
We show how to triangulate a three dimensional polyhedral region with holes. Our triangulation is...
There are a number of applications for which it is desirable to divide a given region in the plane ...
We present a simple new algorithm for triangulating poly-gons and planar straightline graphs. It pro...
We present an experimental study of different strate-gies for triangulating polygons in parallel. As...
A fundamental algorithmic problem in computer graphics is that of computing a succinct encoding of a...
Skeletonization using the Constrained Delaunay Triangulation technique has proven very effective, wi...
The development of methods for storing, manipulating, and rendering large volumes of data efficientl...
In computer graphics, most polygonal surfaces are rendered via triangles. Rendering a set of triangl...
Meisters ’ [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In ...
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points o...
It remains as one of the major open problems in computational geometry, whether there exists a linea...
DOI
Add to ORKG