Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,210,963 papers from all fields of science
Search
Sign In
Create Free Account
Bentley–Ottmann algorithm
Known as:
Bentley-Ottmann algorithm
, Ottmann
In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments. It extends…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Arbitrary-precision arithmetic
Binary heap
Data structure
Deterministic algorithm
Expand
Broader (1)
Computational geometry
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The Withdrawal Clause of the Lisbon Treaty in the Light of EU Citizenship (Between Disintegration and Integration)
C. Rieder
2013
Corpus ID: 1736744
2011
2011
Stock Return and Trading Volume Distribution across the Day-of-the-week: Evidence from the Japanese Stock Market
A. Dhaoui
,
Ramzi Farhani
,
Riadh Garfatta
2011
Corpus ID: 7775379
In this paper, we examine the behavior of stock returns and trading volume across the-day-of-the-week in the context of the…
Expand
2011
2011
Bentley's Support for 3D Cadastre Development
D. Cadastre
2011
Corpus ID: 73626142
Cadastre has been playing a huge role in the development of our society since it aims at registering legal status and property…
Expand
2009
2009
Landscape and season effects on the diet of the Goshawk.
R. Tornberg
,
M. Mönkkönen
,
S. M. Kivelä
2009
Corpus ID: 55741354
There are two general effects of habitat loss and fragmentation of mature boreal forests (Schmiegelow & Monkkonen 2002). First…
Expand
2003
2003
The Reliable Algorithmic Software Challenge RASC
K. Mehlhorn
Computer Science in Perspective
2003
Corpus ID: 3070512
Algorithms are the heart of computer science. They make systems work. The theory of algorithms, i.e., their design and their…
Expand
2003
2003
Computing intersections in a set of line segments : the Bentley-Ottmann algorithm
M. Smid
2003
Corpus ID: 16907076
In these notes, we introduce a powerful technique for solving geometric problems. This technique, called the plane sweep…
Expand
2003
2003
Java Applets for the Dynamic Visualization of Voronoi Diagrams
Christian Icking
,
R. Klein
,
P. Köllner
,
Lihong Ma
Computer Science in Perspective
2003
Corpus ID: 5067526
This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets…
Expand
1999
1999
The bulk expansion of the supernova remnant Cassiopeia A at 151 MHz
M. Agüeros
,
D. Green
1999
Corpus ID: 56051108
We present observations of the supernova remnant Cassiopeia A made over 13 yr at 151 MHz with the Cambridge Low-Frequency…
Expand
1993
1993
A New Locally Adaptive Data Compression Scheme using Multilist Structure
H. K. Chang
,
Shing-Hong Chen
Computer/law journal
1993
Corpus ID: 46693307
A new locally adaptive data compression scheme has been proposed in this paper. The proposed scheme may be viewed as an extension…
Expand
1954
1954
The Incorporation of Labelled Amino-acids into Amphibian Embryos
C. Waddington
,
J. Sirlin
1954
Corpus ID: 28847579
The production of different cell types during embryonic development must depend to a major extent on the synthesis of specific…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE