"Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a ..."

Xavier Provençal, Jacques-Olivier Lachaud (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-04397-0_10

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/dgci/ProvencalL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dgci/ProvencalL09
Xavier Provençal, Jacques-Olivier Lachaud:
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour. DGCI 2009: 104-117

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.