:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Feng, Zhidan, Fernau, Henning, Zhu, Binhai
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry 68 F.2.2
Online Access:	https://arxiv.org/abs/2404.19164
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
by: Liyanage, Adiesha, et al.
Published: (2025)

Determining Factorial Speed Fast
by: Feng, Zhidan, et al.
Published: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

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

Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)

On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

Maximum Centre-Disjoint Mergeable Disks
by: Rudi, Ali Gholami
Published: (2023)

Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
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)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

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

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

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)

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

Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

Computing the second and third systoles of a combinatorial surface
by: Ebbens, Matthijs, et al.
Published: (2024)

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

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
by: Flores-Peñaloza, David, et al.
Published: (2024)

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

Computing shortest closed curves on non-orientable surfaces
by: Bulavka, Denys, et al.
Published: (2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
by: Agarwal, Pankaj K., et al.
Published: (2018)

Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)

The Presort Hierarchy for Geometric Problems
by: van der Hoog, Ivor, et al.
Published: (2026)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
by: Philip, Geevarghese, 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)

Drawing Reeb Graphs
by: Chambers, Erin, 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)

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

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