On constant factors in comparison-based geometric algorithms and data structures (Q2349854): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-015-9677-y / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089943985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5171169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Expected-Case Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal output-sensitive convex hull algorithms in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive results on convex hulls, extreme points, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistent Predecessor Search and Orthogonal Point Location on the Word RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-pass geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing an output-sensitive convex hull algorithm in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bichromatic line-segment problems and polyhedral terrains / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computations under varying sets of primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median Selection Requires $(2+\epsilon)n$ Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provably fast linear-expected-time maxima-finding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heaps on Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Space Partitions of Orthogonal Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification of the convex hull of a finite set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating extreme points in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary space partitions for orthogonal objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Worst Case Query Complexity of Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-015-9677-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:29, 18 December 2024

scientific article
Language Label Description Also known as
English
On constant factors in comparison-based geometric algorithms and data structures
scientific article

    Statements

    On constant factors in comparison-based geometric algorithms and data structures (English)
    0 references
    0 references
    18 June 2015
    0 references
    comparison-based algorithms
    0 references
    maxima
    0 references
    convex hull
    0 references
    line segment intersection
    0 references
    point location
    0 references
    binary space partition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references