Quadrangulations of planar sets
From MaRDI portal
Recommendations
- Quadrangulations on closed surfaces
- On Convex Quadrangulations of Point Sets on the Plane
- Quadri-tilings of the plane
- Planar triangulations which quadrangulate other surfaces
- On well-covered quadrangulations
- Characterizing and efficiently computing quadrangulations of planar point sets
- scientific article; zbMATH DE number 6991367
- Four-connected triangulations of planar point sets
- On area-universal quadrangulations
Cites work
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- scientific article; zbMATH DE number 3700274 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 589497 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- A \(C^ 2\)-quintic spline interpolation scheme on triangulation
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- Advanced techniques for automatic finite element meshing from solid models
- Applications of a semi-dynamic convex hull algorithm
- Automatic conversion of triangular finite element meshes to quadrilateral elements
- Characterizing and efficiently computing quadrangulations of planar point sets
- Converting triangulations to quadrangulations
- Cubic spline fitting using data dependent triangulations
- Dynamic Point Location in General Subdivisions
- Finite element mesh generation methods: A review and classification
- Fully Dynamic Point Location in a Monotone Subdivision
- Geometry-based fully automatic mesh generation and the delaunay triangulation
- New Results on Dynamic Planar Point Location
- No quadrangulation is extremely odd
- On the convex layers of a planar set
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Scattered data interpolation and approximation using bivariate \(C^{1}\) piecewise cubic polynomials
- Traditional Galleries Require Fewer Watchmen
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon in linear time
Cited in
(22)- scientific article; zbMATH DE number 4007101 (Why is no real title available?)
- scientific article; zbMATH DE number 6991367 (Why is no real title available?)
- Computing convex quadrangulations
- Computing convex quadrangulations
- Patchworking arrangements of a cubic and a quartic
- Quadrangulations on closed surfaces
- Quasiparallelism in finite planar spaces
- scientific article; zbMATH DE number 6939352 (Why is no real title available?)
- Which point sets admit a \(k\)-angulation?
- Almost empty monochromatic quadrilaterals in planar point sets
- Enumeration of Inner Leafless Planar Near-quadrangulations
- Uniform infinite half-planar quadrangulations with skewness
- Experimental results on quadrangulations of sets of fixed points
- No quadrangulation is extremely odd
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- Converting triangulations to quadrangulations
- Convex quadrangulations of bichromatic point sets
- QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS
- Quadrangulations of a polygon with spirality
- Geometric quadrangulations of a polygon
- scientific article; zbMATH DE number 4131150 (Why is no real title available?)
- Characterizing and efficiently computing quadrangulations of planar point sets
This page was built for publication: Quadrangulations of planar sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057435)
