Quadrangulations of planar sets
From MaRDI portal
Publication:5057435
DOI10.1007/3-540-60220-8_64zbMath1502.68348OpenAlexW1569301042MaRDI QIDQ5057435
Publication date: 16 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60220-8_64
Related Items (5)
Converting triangulations to quadrangulations ⋮ Convex Quadrangulations of Bichromatic Point Sets ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ Quadrangulations on 3-colored point sets with Steiner points and their winding numbers ⋮ Experimental results on quadrangulations of sets of fixed points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scattered data interpolation and approximation using bivariate \(C^{1}\) piecewise cubic polynomials
- Finite element mesh generation methods: A review and classification
- Advanced techniques for automatic finite element meshing from solid models
- Triangulating a simple polygon in linear time
- A \(C^ 2\)-quintic spline interpolation scheme on triangulation
- A short proof of Chvatal's Watchman Theorem
- Converting triangulations to quadrangulations
- Characterizing and efficiently computing quadrangulations of planar point sets
- A combinatorial theorem in plane geometry
- Cubic spline fitting using data dependent triangulations
- 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
- New Results on Dynamic Planar Point Location
- Automatic conversion of triangular finite element meshes to quadrilateral elements
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Dynamic Point Location in General Subdivisions
- Fully Dynamic Point Location in a Monotone Subdivision
- Applications of a semi-dynamic convex hull algorithm
This page was built for publication: Quadrangulations of planar sets
