Image de couverture de livre

An Optimal Algorithm for Computing Many Faces in Line Arrangements

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Wang, Haitao
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

The Complexity of One or Many Faces in the Overlay of Many Arrangements
par: Har-Peled, Sariel
Publié: (2025)

Computing Arrangements of Hypersurfaces
par: Breiding, Paul, et autres
Publié: (2024)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

General Position Subset Selection in Line Arrangements
par: Dumitrescu, Adrian
Publié: (2025)

Optimal Algorithm for the Planar Two-Center Problem
par: Cho, Kyungjin, et autres
Publié: (2020)

An Optimal Algorithm for Half-plane Hitting Set
par: Liu, Gang, et autres
Publié: (2025)

Detecting Zariski Pairs by Algorithms and Computational Classification in Conic Line Arrangements
par: Amram, Meirav, et autres
Publié: (2026)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2025)

On the Line-Separable Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2023)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
par: Park, Eunku
Publié: (2026)

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

Algorithms for Halfplane Coverage and Related Problems
par: Wang, Haitao, et autres
Publié: (2024)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

On Triangles in Colored Pseudoline Arrangements
par: Radtke, Yan Alves, et autres
Publié: (2026)

Minimal Arrangements of Spherical Geodesics
par: Viglietta, Giovanni
Publié: (2023)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

Sweeping Arrangements of Non-Piercing Curves in Plane
par: Dalal, Suryendu, et autres
Publié: (2024)

Dynamic 3D Convex Hulls Revisited and Applications
par: Wang, Haitao
Publié: (2026)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2026)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

Improved Lower Bound on the Number of Pseudoline Arrangements
par: Dallant, Justin
Publié: (2024)

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem
par: Dallant, Justin
Publié: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
par: Park, Seongbin, et autres
Publié: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2024)

Efficient Many-To-Many Matching of Points with Demands in One Dimension
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2019)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
par: Chung, Chaeyoon, et autres
Publié: (2026)

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
par: Borzechowski, Michaela, et autres
Publié: (2026)

Algorithms for Dynamic Computational Geometry with Applications
par: Boxer, Laurence
Publié: (2025)

Shortest Paths in Geodesic Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2026)

Zone Theorem for Arrangements in three dimensions
par: Saxena, Sanjeev
Publié: (2020)

Counting Unit Circular Arc Intersections
par: Wang, Haitao
Publié: (2026)

A Deterministic Partition Tree and Applications
par: Wang, Haitao
Publié: (2025)

Shortest Paths on Convex Polyhedral Surfaces
par: Wang, Haitao
Publié: (2025)

Concise Plane Arrangements for Low-Poly Surface and Volume Modelling
par: Sulzer, Raphael, et autres
Publié: (2024)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
par: Chhabra, Himanshu, et autres
Publié: (2024)

A Condition Number Analysis of a Line-Surface Intersection Algorithm
par: Srijuntongsiri, Gun, et autres
Publié: (2006)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

How Many Slopes Does Polynomial Area Cost?
par: Bekos, Michael A., et autres
Publié: (2026)