On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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.1007/s10472-014-9421-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010334175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link watchman tours / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectilinear link distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zookeeper route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonally convex covering of orthogonal polygons without holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Shortest Isothetic Path inside a Digital Object / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar rectilinear shortest path computation using corridors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum rectilinear distance paths in the presence of barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes under limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the watchman route and zookeeper's problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest safari routes in simple polygons / rank
 
Normal rank

Latest revision as of 21:24, 10 July 2024

scientific article
Language Label Description Also known as
English
On finding a shortest isothetic path and its monotonicity inside a digital object
scientific article

    Statements

    On finding a shortest isothetic path and its monotonicity inside a digital object (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2015
    0 references
    shortest path
    0 references
    shortest isothetic path
    0 references
    Manhattan path
    0 references
    monotone path
    0 references
    shape analysis
    0 references
    digital geometry
    0 references
    monotonicity number
    0 references

    Identifiers