No quadrangulation is extremely odd

DOI10.1007/BFB0015443zbMATH Open1512.68403MaRDI QIDQ6487985FDOQ6487985

Authors: Prosenjit Bose, Godfried Toussaint 

Publication date: 21 March 2023

Recommendations

• Characterizing and efficiently computing quadrangulations of planar point sets
• Quadrangulations of planar sets
• On Convex Quadrangulations of Point Sets on the Plane
• scientific article; zbMATH DE number 2081026
• Converting triangulations to quadrangulations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Graph theory with applications
• Traditional Galleries Require Fewer Watchmen
• Title not available (Why is that?)
• Applications of a semi-dynamic convex hull algorithm
• Title not available (Why is that?)
• On the convex layers of a planar set
• Title not available (Why is that?)

Cited In (10)

• Graham triangulations and triangulations with a center are Hamiltonean
• On Convex Quadrangulations of Point Sets on the Plane
• Quadrangulations of planar sets
• Which point sets admit a \(k\)-angulation?
• Almost empty monochromatic quadrilaterals in planar point sets
• Experimental results on quadrangulations of sets of fixed points
• Illumination by floodlights
• Converting triangulations to quadrangulations
• Numerical integration over polygons using an eight-node quadrilateral spline finite element
• A new 8-node quadrilateral spline finite element

This page was built for publication: No quadrangulation is extremely odd

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487985)