Amanote Research

Amanote Research

    RegisterSign In

An Optimal Algorithm for Intersecting Line Segments in the Plane

doi 10.1109/sfcs.1988.21975
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1988

Authors
B. ChazelleH. Edelsbrunner
Publisher

IEEE


Related search

An Optimal Algorithm for Computing Visibility in the Plane

SIAM Journal on Computing
MathematicsComputer Science
1995English

An Optimal Algorithm for the On-Line Closest-Pair Problem

1992English

A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

An Optimal Path Cover Algorithm for Cographs

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1995English

An Optimal Algorithm for the Minimum Disc Cover Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

An Optimal Parallel Algorithm for Learning DFA

1994English

An On-Line Algorithm for Checkpoint Placement

English

An Optimal Algorithm for Over-The-Air Reprogramming Protocol in WSNs

Communications and Network
2009English

Research on Multi-Sensor Image Matching Algorithm Based on Improved Line Segments Feature

ITM Web of Conferences
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy