60 search results - page 1 / 12 » Cardinality Bounds for Triangulations with Bounded Minimum A... |
CCCG
1994
13 years 8 months ago
1994
We consider bounding the cardinality of an arbitrary triangulation with smallest angle : We show that if the local feature size (i.e. distance between disjoint vertices or edges) ...
CCCG
2004
13 years 8 months ago
2004
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
WINE
2009
Springer
14 years 1 months ago
2009
Springer
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...