"On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for ..."

Simon Kahan, Jack Snoeyink (1996)

> Home

Details and statistics

DOI: 10.1145/237218.237342

access: closed

type: Conference or Workshop Paper

metadata version: 2021-06-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compgeom/KahanS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/KahanS96
Simon Kahan, Jack Snoeyink:
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. SCG 1996: 151-158

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.