"Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space."

Ovidiu Daescu, Ka Yaw Teo (2023)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2024-07-02

- no documents available
- export record
  dblp key:
  - conf/cccg/DaescuT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/DaescuT23
Ovidiu Daescu, Ka Yaw Teo:
Approximate Line Segment Nearest Neighbor Search amid Polyhedra in 3-Space. CCCG 2023: 291-297

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.