Results 121 to 130 of about 7,016 (227)
Journal of Computational GeometryAny surface that is intrinsically polyhedral can be represented by a collection of simple polygons (fragments), glued along pairs of equally long oriented edges, where each fragment is endowed with the geodesic metric arising from its Euclidean metric ...
Tim Ophelders +3 more
doaj +1 more source
Generalizing the Convex Hull of a Sample: The R Package alphahull
This paper presents the R package alphahull which implements the ñ-convex hull and the ñ-shape of a finite set of points in the plane. These geometric structures provide an informative overview of the shape and properties of the point set. Unlike the
Alberto Rodríguez-Casal +1 more
core +1 more source
The Delaunay triangulation maximizes the mean inradius
, 1994 I prove that amongst all triangulations of a planar point set the Delaunay triangulation maximizes the arithmetic mean of the inradii of the triangles.
Timothy Lambert
core
Delaunay Triangulation and Its Applications
Delaunay triangulation is a significant geometric concept with applications in computer graphics, geographic information systems, medicine, and engineering.
Kojdová, Monika
core
Delaunay Triangulation and Randomized Constructions [PDF]
, 2014 The Delaunay triangulation and the Voronoi diagram are two classic geometric structures in the field of computational geometry. Their success can perhaps be attributed to two main reasons: Firstly, there exist practical, efficient algorithms to construct them; and secondly, they have an enormous number of useful applications ranging from meshing and 3D-
openaire +2 more sources
Constrained Delaunay triangulation for multiresolution surface description
, 1988 The problem of building a constrained Delaunay triangulation (CDT) at different levels of resolution is considered for the hierarchical description of topographic surfaces. The surface is approximated at each level by a network of planar triangular faces
Puppo Enrico, De Floriani Leila
core
Text string extraction in delaunay triangulation
, 2003 This paper establishes a Delaunay triangulation model for detecting text strings in an image. In this method, text regions are represented based on Delaunay triangles that can be extracted easily. A searching mechanism based on the left and right arms of
Huimin Grace Guo, Yi Xiao, Hong Yan
core
Graph Theory and Mean Shift Segmentation Based Classification of Building Facades
, 2011 Automatic classification of building facades has become a field of interest for researchers, since it can provide important solutions to many remote sensing research field.
Sirmacek, Beril, Beril Sirmacek
core +1 more source
Delaunay triangulation of non-convex planar domains
, 1989 This paper investigates the possibility of integrating the two currently most popular mesh generation techniques, namely the method of advancing front and the Delaunay triangulation algorithm.
Lo, SH
core
四川大学学报. 自然科学版, 2003 The data structure and the raster graphics algorithm for producing the Voronoi in discrete plane preseted. Delaunay triangulation can be realized on the basis of the data structure.
罗以宁, 王开平
doaj