Image de couverture de livre

Faster, Deterministic and Space Efficient Subtrajectory Clustering

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	van der Hoog, Ivor, van der Horst, Thijs, Ophelders, Tim
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Faster Fréchet Distance Approximation through Truncated Smoothing
par: van der Horst, Thijs, et autres
Publié: (2024)

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

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
par: van der Horst, Thijs, et autres
Publié: (2025)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
par: Conradi, Jacobus, et autres
Publié: (2025)

Robust Bichromatic Classification using Two Lines
par: Glazenburg, Erwin, et autres
Publié: (2024)

Efficient Greedy Discrete Subtrajectory Clustering
par: van der Hoog, Ivor, et autres
Publié: (2025)

Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
par: Conradi, Jacobus, et autres
Publié: (2025)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
par: Gæde, Emil Toftegaard, et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
par: van Renssen, Andrè, et autres
Publié: (2022)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
par: Picarella, Gianmarco, et autres
Publié: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

Fréchet Distance in Unweighted Planar Graphs
par: van der Hoog, Ivor, et autres
Publié: (2025)

Drawing Reeb Graphs
par: Chambers, Erin, et autres
Publié: (2025)

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

Unfolding Polycubes with Orthogonally Convex Layers
par: Damian, Mirela, et autres
Publié: (2024)

Evolving Distributions Under Local Motion
par: Acharya, Aditya, et autres
Publié: (2024)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
par: Becker, Aaron T., 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)

Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power
par: Loi, Chek-Manh, et autres
Publié: (2026)

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

Approximating Euclidean Shallow-Light Trees
par: Le, Hung, et autres
Publié: (2025)

Online Competitive Searching for Rays in the Half-plane
par: Langetepe, Elmar, et autres
Publié: (2025)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
par: Damian, Mirela, et autres
Publié: (2003)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
par: Fekete, Sándor P., et autres
Publié: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
par: Le, Hung, et autres
Publié: (2021)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
par: Feng, Zhidan, et autres
Publié: (2024)

Multi-Covering a Point Set by $m$ Disks with Minimum Total Area
par: Guitouni, Mariem, et autres
Publié: (2025)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
par: Kirkpatrick, David, et autres
Publié: (2025)

Super Guarding and Dark Rays in Art Galleries
par: MIT CompGeom Group, et autres
Publié: (2024)

Reconfiguration of Squares Using a Constant Number of Moves Each
par: van der Horst, Thijs, et autres
Publié: (2026)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
par: Gudmundsson, Joachim, et autres
Publié: (2021)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

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

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
par: Bose, Prosenjit, et autres
Publié: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

On the Connectivity of the Flip Graph of Plane Spanning Paths
par: Kleist, Linda, et autres
Publié: (2024)

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