Computing the smallest \(k\)-enclosing circle and related problems (Q1328752): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0925-7721(94)90003-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007046733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for neighbor searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on geometric pattern matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enclosing k points by a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-sets in arrangements of curves and surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank

Latest revision as of 16:04, 22 May 2024

scientific article
Language Label Description Also known as
English
Computing the smallest \(k\)-enclosing circle and related problems
scientific article

    Statements

    Computing the smallest \(k\)-enclosing circle and related problems (English)
    0 references
    0 references
    0 references
    0 references
    3 August 1994
    0 references
    geometric optimization
    0 references
    smallest enclosing circle
    0 references
    smallest homothetic copy
    0 references

    Identifiers