Cover Image

Drawing Reeb Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chambers, Erin, Fasy, Brittany Terese, Sereshgi, Erfan Hosseini, Löffler, Maarten
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry F.2.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Super Guarding and Dark Rays in Art Galleries
by: MIT CompGeom Group, et al.
Published: (2024)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Knop, Dušan, et al.
Published: (2017)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
by: Bo, Dong, et al.
Published: (2025)

Deltahedral Domes over Equiangular Polygons
by: MIT CompGeom Group, et al.
Published: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)

Skeletal Cut Loci on Convex Polyhedra
by: O'Rourke, Joseph, et al.
Published: (2023)

Prismatoid Band-Unfolding Revisited
by: O'Rourke, Joseph
Published: (2026)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Hamiltonian Quasigeodesics yield Nets
by: O'Rourke, Joseph
Published: (2022)

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes
by: de Verdière, Éric Colin, et al.
Published: (2021)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

Graph Threading with Turn Costs
by: Demaine, Erik D., et al.
Published: (2024)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
by: Picarella, Gianmarco, et al.
Published: (2025)

Approximating Euclidean Shallow-Light Trees
by: Le, Hung, et al.
Published: (2025)

Online Competitive Searching for Rays in the Half-plane
by: Langetepe, Elmar, et al.
Published: (2025)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
by: Fekete, Sándor P., et al.
Published: (2025)

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
by: Loi, Chek-Manh, et al.
Published: (2026)

Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells
by: Shewchuk, Jonathan Richard
Published: (2026)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

Unfolding Polycubes with Orthogonally Convex Layers
by: Damian, Mirela, et al.
Published: (2024)

Evolving Distributions Under Local Motion
by: Acharya, Aditya, et al.
Published: (2024)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2024)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
by: Becker, Aaron T., et al.
Published: (2024)

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)