I've been reviewing some background in Computational Geometry. And I've been studying from this book (which is my main reference) and some other paper/lecture notes I've found on the web. My question is, when you study algorithm and data structures usually what is an Abstract data type is explained, for example for binary tree you would have something like insert, delete, find min, find max, find next, find prev etc. Is there something similar for a DCEL? what kind of operations are usually supported by such data structure?I know how such structure is used (plane sweep paradigm mainly) I've also seen some code that actually implements this data structure in a very naive way (just several structs with pointers basically) but I would like to know what operations are actually supported from such data structures, it's just a main reference I would need.Also there's one more question. As far as I've seen creating a DCEL is quite difficult to create (especially if you want it reliable). I've been trying to figure out if there's an alternative data structures, maybe simpler than a DCEL that can be easily used to implement algorithms based on the sweep line paradigm (the DeBerg book basically in 90% of the times describes output in terms of DCEL).Implementing map overlay is tedious, but in my case is because I don't actually know how to properly design the DCEL data structure (especially the operations it has to support).This book is more... application and implementation focused, I haven't read through all the book, however I've been reading the part related to geometric data structures, and a Polygon data structure is proposed. Later on I assume it will be explained how to implement a sweep line algorithm using this data structure. It's the only one pretty practical I've seen so far (together with computational geometry in C of Rourke). However I've seen some negative reviews about the second book I'm mentioning, so I'm not sure how reliable could be the designs of such data structures when dealing with more complicated algorithms.So, is there a very good survey of geometric data structures that I could use as reference?
Abstract data type for Doubly Connected Edge List or alternatives?
data structures;reference request;computational geometry