Work

An optimal algorithm for finding segments intersections

Year: 1995

Type: conference-paper

Abstract: This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set of N segments in the plane.The algorithm is asymptotically optimal and has time and space complexity O(AJ log N+ K) and 0( IV ) respectively, where K is the number of intersecting pairs.The algorithm may be used for finding intersections not only line segments but also curve segments.

Source: Annual Symposium on Computational Geometry (SoCG)

DOI: 10.1145/220279.220302

Author: Ivan J. Balaban

Institution: Keldysh Institute of Applied Mathematics

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2088994929

FWCI: 1.704

Cites: 11

Cited by: 168

Related to: 10