Redirect to:
Feodor; Vaxès, Yann (2002), "Center and diameter problem in planar quadrangulations and triangulations", Proc. 13th Annu. ACM–SIAM Symp. on Discrete Algorithms...
Click to read more »monotone trees (total edge length, total distance from root, etc.). For a quadrangulation Q {\displaystyle Q} is the separating decomposition an orientation...
Click to read more »Lines of curvature make a quadrangulation of the domain...
Click to read more »edges necessarily form a quadrangulation (a polyhedral graph in which every face is a quadrilateral). Every quadrangulation gives rise to an optimal 1-planar...
Click to read more »(2002), "Center and diameter problems in plane triangulations and quadrangulations", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete...
Click to read more »cow 2,930 vertices 5,856 triangles CC0 Catmull-Clark control mesh, quadrangulation, triangulation, vector texture, and bitmap texture. All meshes are...
Click to read more »CO]. Van den Camp, Heidi; McKay, Brendan (2024). "Generating Plane Quadrangulations and Symmetry-preserving Operations on Maps". Discrete Mathematics &...
Click to read more »processing Jingwei Huang et al. QuadFlow: A Scalable and Robust Method for Quadrangulation Marc Comino et al. Sensor-aware Normal Estimation for Range Scan Point...
Click to read more »perimeter oriented bounding box Onion triangulations Spiral triangulations Quadrangulation Nice triangulation Art gallery problem Wedge placement optimization...
Click to read more »completely-labeled cubes is odd. Musin extended these results to general quadrangulations. Suppose that, instead of a single labeling, we have n different Sperner...
Click to read more »edge, and every optimal 1-planar graph (a graph formed from a planar quadrangulation by adding two crossing diagonals to every quadrilateral face) is a...
Click to read more »quadrilateralization or a quadrangulation is a partition into quadrilaterals. A recurring characteristic of quadrangulation problems is whether they Steiner...
Click to read more »(2013). "The Brownian map is the scaling limit of uniform random plane quadrangulations". Acta Mathematica. 210 (2): 319–401. arXiv:1104.1606. doi:10.1007/s11511-013-0096-8...
Click to read more »Miermont, "The Brownian map is the scaling limit of uniform random plane quadrangulations". Acta Math. 210, 319–401 (2013) doi:10.1007/s11511-013-0096-8. "CV...
Click to read more »Dragan, F.; Vaxès, Y. (2002), "Center and diameter problems in planar quadrangulations and triangulations", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms...
Click to read more »