Image de couverture de livre

Compatible Triangulations of Simple Polygons

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Afshani, Peyman, Aronov, Boris, Buchin, Kevin, Buchin, Maike, Cheong, Otfried, Klost, Katharina, Rehs, Carolin, Rote, Günter
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Geometric spanners of bounded tree-width
par: Buchin, Kevin, et autres
Publié: (2024)

Property Testing of Curve Similarity
par: Afshani, Peyman, et autres
Publié: (2025)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

Bicriteria approximation for minimum dilation graph augmentation
par: Buchin, Kevin, et autres
Publié: (2024)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
par: Buchin, Kevin, et autres
Publié: (2026)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
par: Buchin, Kevin, et autres
Publié: (2025)

Faster Fréchet Distance under Transformations
par: Buchin, Kevin, et autres
Publié: (2025)

Computing Oriented Spanners and their Dilation
par: Buchin, Kevin, et autres
Publié: (2024)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
par: Buchin, Kevin, et autres
Publié: (2024)

Oriented Spanners
par: Buchin, Kevin, et autres
Publié: (2023)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Minimum spanning blob-trees
par: Klost, Katharina, et autres
Publié: (2025)

Orienteering (with Time Windows) on Restricted Graph Classes
par: Buchin, Kevin, et autres
Publié: (2024)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
par: Angrick, Sebastian, et autres
Publié: (2026)

NumPSLA -- An experimental research tool for pseudoline arrangements and order types
par: Rote, Günter
Publié: (2025)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Better Late than Never: the Complexity of Arrangements of Polyhedra
par: Aronov, Boris, et autres
Publié: (2025)

Convexity Helps Iterated Search in 3D
par: Afshani, Peyman, et autres
Publié: (2025)

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
par: Klost, Katharina, et autres
Publié: (2024)

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
par: Afshani, Peyman, et autres
Publié: (2026)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
par: Chan, Timothy M.
Publié: (2026)

Sweeping $x$-monotone pseudolines
par: Biedl, Therese, et autres
Publié: (2025)

Grid Peeling of Parabolas
par: Rote, Günter, et autres
Publié: (2024)

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
par: Aronov, Boris, et autres
Publié: (2019)

Some Counterexamples for Compatible Triangulations
par: Barnson, Cody, et autres
Publié: (2016)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

Covering Simple Orthogonal Polygons with Rectangles
par: Roy, Aniket Basu
Publié: (2024)

Long Plane Trees
par: Cabello, Sergio, et autres
Publié: (2021)

Finding a Shortest Curve that Separates Few Objects from Many
par: Biedl, Therese, et autres
Publié: (2025)

Discrete Fréchet Distance Oracles
par: Aronov, Boris, et autres
Publié: (2024)

Packing d-dimensional balls into a d+1-dimensional container
par: Alt, Helmut, et autres
Publié: (2021)

Multirobot Watchman Routes in a Simple Polygon
par: Mitchell, Joseph S. B., et autres
Publié: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
par: Aronov, Boris, et autres
Publié: (2024)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Minimum Star Partitions of Simple Polygons in Polynomial Time
par: Abrahamsen, Mikkel, et autres
Publié: (2023)

Nearest Neighbor Searching in a Dynamic Simple Polygon
par: de Berg, Sarita, et autres
Publié: (2025)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
par: Fekete, Sándor P., et autres
Publié: (2024)