The paper describes a modification of DAG-based location for incremental insertion Delaunay triangulation algorithm in E2 and E3. Instead of the whole simplices, only their separating faces are stored and tested. This enables to reduce time for point location and memory requirements.
The paper describes a modification of DAG-based location for incremental insertion Delaunay triangulation algorithm in E2 and E3. Instead of the whole simplices, only their separating faces are stored and tested. This enables to reduce time for point location and memory requirements. (en)