Farthest-point queries with geometric and combinatorial constraints (Q2489542): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098197750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding all farthest neighbors in a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest neighbors, maximum spanning trees and related problems in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for approximating polygonal chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING CLOSEST POINTS FOR SEGMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries with segments in Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing farthest neighbors on a convex polytope. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric retrieval problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygonal chain approximation: A query based approach / 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: Q4411284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location and the geometric minimum-diameter spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of geometric duality revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently computing the closest point to a query line / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:21, 24 June 2024

scientific article
Language Label Description Also known as
English
Farthest-point queries with geometric and combinatorial constraints
scientific article

    Statements

    Farthest-point queries with geometric and combinatorial constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    Farthest-point queries
    0 references
    Line-segment queries
    0 references
    Polygonal path simplification
    0 references
    0 references