An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
description / endescription / en
 
scientific article; zbMATH DE number 6498704
Property / title
 
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (English)
Property / title: An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1440.68314 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-47672-7_77 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
27 October 2015
Timestamp+2015-10-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 27 October 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6498704 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2233662001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRIANGULATING DISJOINT JORDAN CHAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectilinear link distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point L1 Shortest Path Queries in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037425 / 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: Computing the visibility polygon from a convex set and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum length paths of a given homotopy class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Geometric Graph Search Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for rectilinear link-distance problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation and approximation of polyhedral objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMUM-LINK C-ORIENTED PATHS: SINGLE-SOURCE QUERIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation and shape-complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear shortest paths in the presence of rectangular barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n\log n)\) algorithm for computing the link center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Simple Polygons and Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting jordan sequences in linear time using level-linked search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank

Latest revision as of 19:47, 17 July 2024

scientific article; zbMATH DE number 6498704
  • An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
Language Label Description Also known as
English
An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
scientific article; zbMATH DE number 6498704
  • An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

Statements

An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (English)
0 references
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (English)
0 references
0 references
0 references
0 references
0 references
11 January 2019
0 references
27 October 2015
0 references
0 references
0 references
0 references
0 references

Identifiers

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