Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimum number of partial triangulations

From MaRDI portal
Publication:2107503
Jump to:navigation, search

DOI10.1016/j.ejc.2022.103636zbMath1506.52005arXiv2104.05855OpenAlexW3153651057MaRDI QIDQ2107503

Aleksei Volostnov, Yury Yarovikov, Andrey B. Kupavskii

Publication date: 1 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.05855


zbMATH Keywords

triangulationCatalan numberconvex hullpartial triangulationquasi-convex set of points


Mathematics Subject Classification ID

Approximation by convex sets (52A27)




Cites Work

  • Triangulations. Structures for algorithms and applications
  • A better upper bound on the number of triangulations of a planar point set
  • A lower bound on the number of triangulations of planar point sets
  • Transforming triangulations
  • On the number of plane graphs
  • The Number of Triangulations on Planar Point Sets
  • Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
  • Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Minimum number of partial triangulations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2107503&oldid=14596286"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki