"A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in ..."

Timothy M. Chan (2016)

> Home

Details and statistics

DOI: 10.1007/S00454-016-9785-3

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dcg/Chan16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/Chan16
Timothy M. Chan:
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions. Discret. Comput. Geom. 56(4): 860-865 (2016)

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.