Computational geometry: an introduction
Computational geometry: an introduction
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Time and space efficient net extractor
Computer-Aided Design
The complexity and construction of many faces in arrangements of lines and of segments
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Partitioning arrangements of lines, part II: applications
Discrete & Computational Geometry
Partitioning arrangements of lines, part I: an efficient deterministic algorithm
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Cutting hyperplane arrangements
Discrete & Computational Geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A fast algorithm for VLSI net extraction
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hide-and-seek: algorithms for polygonWalk problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
| Hi-index | 14.98 |
It is shown that given a set of n line segments, their connected components can be computed in time O(n4/3log3n). A bound of o(n4/3) for this problem would imply a similar bound for detecting, for a given set of n points and n lines, whether some point lies on some of the lines. This problem, known as Hopcroft驴s problem, is believed to have a lower bound of 驴(n4/3). For the special case when for each segment both endpoints fall inside the same face of the arrangement induced by the set of segments, we give an algorithm that runs in O(nlog 3n) time.