Dynamic Minimum Length Polygon (Q3003536)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Dynamic Minimum Length Polygon	scientific article

Statements

scholarly article

0 references

Dynamic Minimum Length Polygon (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-21073-0_20

0 references

Xavier Provençal

0 references

Jacques-Olivier Lachaud

0 references

Lecture Notes in Computer Science

0 references

publication date

27 May 2011

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-21073-0_20

0 references

0 references

Combinatorics on Words

0 references

Certain words on the real projective line

0 references

Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model

0 references

0 references

0 references

0 references

A note on minimal length polygonal approximation to a digitized contour

0 references

Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour

0 references

What Does Digital Straightness Tell about Digital Convexity?

0 references

Multiscale Discrete Geometry

0 references

Minimum-Perimeter Polygons of Digitized Silhouettes

0 references

On piecewise linear approximation of planar Jordan curves

0 references

0 references

0 references

0 references

Digital Deformable Model Simulating Active Contours

0 references

Discrete images, objects, and functions in \(Z^ n\)

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3003536

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3003536&oldid=35229268"