Image de couverture de livre

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cabello, Sergio, Das, Arun Kumar, Das, Sandip, Mukherjee, Joydeep
Format:	Preprint
Publié:	2021
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Ortho-Radial Drawing in Near-Linear Time
par: Chang, Yi-Jun
Publié: (2023)

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
par: Duan, Hongyi, et autres
Publié: (2025)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
par: Chandran, L. Sunil, et autres
Publié: (2024)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
par: Das, Arun Kumar, et autres
Publié: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
par: Depian, Thomas, et autres
Publié: (2025)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
par: Banik, Aritra, et autres
Publié: (2024)

Testing Calibration in Nearly-Linear Time
par: Hu, Lunjia, et autres
Publié: (2024)

An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications
par: Librino, Federico, et autres
Publié: (2012)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
par: Conradi, Jacobus, et autres
Publié: (2026)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

Fréchet Distance in Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2024)

Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
par: Kumar, Manish, et autres
Publié: (2026)

2-Layer Fan-Planarity in Polynomial Time
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Dynamically Maintaining the Persistent Homology of Time Series
par: di Montesano, Sebastiano Cultrera, et autres
Publié: (2023)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2025)

Precoloring extension with demands on paths
par: Das, Arun Kumar, et autres
Publié: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

Continuous Map Matching to Paths under Travel Time Constraints
par: Bosch, Yannick, et autres
Publié: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2024)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
par: S, Ajaykrishnan E, et autres
Publié: (2025)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

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

Near-Optimal Bounds for Parameterized Euclidean k-means
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Touring a Sequence of Orthogonal Polygons
par: Casel, Katrin, et autres
Publié: (2026)

Bifurcation: How to Explore a Tree
par: Har-Peled, Sariel
Publié: (2025)

On computing the (exact) Fréchet distance with a frog
par: Conradi, Jacobus, et autres
Publié: (2025)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
par: Di Battista, Giuseppe, et autres
Publié: (2024)

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
par: Bartlmae, Simon, et autres
Publié: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
par: Das, Syamantak, et autres
Publié: (2024)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
par: Inoue, Yuta, et autres
Publié: (2026)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
par: Lokshtanov, Daniel, et autres
Publié: (2024)