Convex Polygons in Geometric Triangulations
From MaRDI portal
Publication:3449827
DOI10.1007/978-3-319-21840-3_24zbMath1372.68262arXiv1411.1303OpenAlexW2156083238MaRDI QIDQ3449827
Adrian Dumitrescu, Csaba D. Tóth
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.1303
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Counting carambolas ⋮ Convex Polygons in Geometric Triangulations ⋮ Monotone paths in geometric triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Counting carambolas
- Finding minimum area \(k\)-gons
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting triangulations and other crossing-free structures approximately
- On the number of plane geometric graphs
- Hybrid discretization of the Signorini problem with Coulomb friction. Theoretical aspects and comparison of some numerical solvers
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- Counting crossing-free structures
- Counting Plane Graphs with Exponential Speed-Up
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Convex Polygons in Geometric Triangulations
- On the Number of Cycles in Planar Graphs
- Crossing-Free Subgraphs
- The Erdos-Szekeres problem on points in convex position – a survey
- Counting and Enumerating Crossing-free Geometric Graphs
- How Many Potatoes Are in a Mesh?
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems
- Number of Crossing-Free Geometric Graphs vs. Triangulations
- Counting Plane Graphs: Cross-Graph Charging Schemes
This page was built for publication: Convex Polygons in Geometric Triangulations
