Finding the upper envelope of n line segments in O(n log n) time (Q582095): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q29302733, #quickstatements; #temporary_batch_1719332822301
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: J. E. Hershberger / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U99 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4130010 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational geometry
Property / zbMATH Keywords: computational geometry / rank
 
Normal rank
Property / zbMATH Keywords
 
upper envelope
Property / zbMATH Keywords: upper envelope / rank
 
Normal rank
Property / zbMATH Keywords
 
Davenport-Schinzel sequence
Property / zbMATH Keywords: Davenport-Schinzel sequence / rank
 
Normal rank
Property / author
 
Property / author: J. E. Hershberger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90136-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020590137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some dynamic computational geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Connected with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar realizations of nonlinear Davenport-Schinzel sequences by segments / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29302733 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:28, 25 June 2024

scientific article
Language Label Description Also known as
English
Finding the upper envelope of n line segments in O(n log n) time
scientific article

    Statements

    Identifiers