Cover Image

An Optimal Algorithm for Computing Many Faces in Line Arrangements

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wang, Haitao
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Computing Arrangements of Hypersurfaces
by: Breiding, Paul, et al.
Published: (2024)

Algorithms for Computing Closest Points for Segments
by: Wang, Haitao
Published: (2024)

General Position Subset Selection in Line Arrangements
by: Dumitrescu, Adrian
Published: (2025)

Optimal Algorithm for the Planar Two-Center Problem
by: Cho, Kyungjin, et al.
Published: (2020)

An Optimal Algorithm for Half-plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)

Detecting Zariski Pairs by Algorithms and Computational Classification in Conic Line Arrangements
by: Amram, Meirav, et al.
Published: (2026)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2025)

On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
by: Liu, Gang, et al.
Published: (2024)

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

Better Late than Never: the Complexity of Arrangements of Polyhedra
by: Aronov, Boris, et al.
Published: (2025)

Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)

Improved Algorithms for Distance Selection and Related Problems
by: Wang, Haitao, et al.
Published: (2023)

On Triangles in Colored Pseudoline Arrangements
by: Radtke, Yan Alves, et al.
Published: (2026)

Minimal Arrangements of Spherical Geodesics
by: Viglietta, Giovanni
Published: (2023)

Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)

Sweeping Arrangements of Non-Piercing Curves in Plane
by: Dalal, Suryendu, et al.
Published: (2024)

Dynamic 3D Convex Hulls Revisited and Applications
by: Wang, Haitao
Published: (2026)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2024)

Improved Lower Bound on the Number of Pseudoline Arrangements
by: Dallant, Justin
Published: (2024)

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem
by: Dallant, Justin
Published: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

Efficient Many-To-Many Matching of Points with Demands in One Dimension
by: Rajabi-Alni, Fatemeh, et al.
Published: (2019)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
by: Borzechowski, Michaela, et al.
Published: (2026)

Algorithms for Dynamic Computational Geometry with Applications
by: Boxer, Laurence
Published: (2025)

Shortest Paths in Geodesic Unit-Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2026)

Zone Theorem for Arrangements in three dimensions
by: Saxena, Sanjeev
Published: (2020)

Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)

A Deterministic Partition Tree and Applications
by: Wang, Haitao
Published: (2025)

Shortest Paths on Convex Polyhedral Surfaces
by: Wang, Haitao
Published: (2025)

Concise Plane Arrangements for Low-Poly Surface and Volume Modelling
by: Sulzer, Raphael, et al.
Published: (2024)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
by: Chhabra, Himanshu, et al.
Published: (2024)

A Condition Number Analysis of a Line-Surface Intersection Algorithm
by: Srijuntongsiri, Gun, et al.
Published: (2006)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

How Many Slopes Does Polynomial Area Cost?
by: Bekos, Michael A., et al.
Published: (2026)