Algorithmic enumeration of surrounding polygons
From MaRDI portal
Publication:1983143
DOI10.1016/j.dam.2020.03.034OpenAlexW3015766876MaRDI QIDQ1983143
Tanami Yamauchi, Yoshio Okamoto, Takashi Horiyama, Ryuhei Uehara, Katsuhisa Yamanaka, David Avis
Publication date: 15 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.034
Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68Uxx)
Cites Work
- Visibility and intersection problems in plane geometry
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- Ray shooting in polygons using geodesic triangulations
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- On local transformation of polygons with visibility properties.
- An efficient algorithm for enumeration of triangulations
- Enumerating order types for small point sets with applications
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
- Reverse search for enumeration
- Generating random polygons with given vertices
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
- Polygons Have Ears
- Counting and enumerating crossing-free geometric graphs
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
