Characterizing and efficiently computing quadrangulations of planar point sets
From MaRDI portal
Publication:1389729
DOI10.1016/S0167-8396(97)00013-7zbMath0893.68153MaRDI QIDQ1389729
Prosenjit Bose, Godfried T. Toussaint
Publication date: 30 June 1998
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Related Items
CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS ⋮ Bichromatic quadrangulations with Steiner points ⋮ Quadrangulations of planar sets ⋮ Convex Quadrangulations of Bichromatic Point Sets ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Quadrangulations on 3-colored point sets with Steiner points and their winding numbers ⋮ Affine invariant triangulations ⋮ Experimental results on quadrangulations of sets of fixed points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing optimal triangulations using simulated annealing
- Finite element mesh generation methods: A review and classification
- A \(C^ 2\)-quintic spline interpolation scheme on triangulation
- Least squares surface approximation to scattered data using multiquadratic functions
- Bemerkungen zum Vierfarbenproblem
- Traditional Galleries Require Fewer Watchmen
- On the convex layers of a planar set
- Triangulating Simple Polygons and Equivalent Problems
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- Scattered Data Interpolation: Tests of Some Method
- New Results on Dynamic Planar Point Location
- Automatic conversion of triangular finite element meshes to quadrilateral elements
- Dynamic Point Location in General Subdivisions
- Fully Dynamic Point Location in a Monotone Subdivision
- Applications of a semi-dynamic convex hull algorithm
- Convex Maps
