The Bowyer-Watson algorithm; An efficient implementation in a database environment

Christoph Arens · Data Archiving and Networked Services (DANS) · 2002

This report describes a research towards how a TIN needs to be structured and indexed in a DBMS (Oracle) to efficiently implement the Bowyer-Watson algorithm.This provides a case for the research that determines if the present databases are able to store and use geographical data without slo wing down the system and with the advantages that a DBMS offers.The research in this report is performed during the course Geo-DBMS case study (Ge4631) as part of my study in Geodesy at the faculty of Civil Engineering and Geosciences at Delft University of Technology.The course goal is to gain experience in using databases to handle spatial data.I would like to thank ir. E.Verbree for all his help as my supervisor.Furthermore, I would like to thank drs.C.W.Quak for getting me started with Java and drs.T.P.M.Tijssen for his help as database administrator.

Read the paper · More papers on PaperTik