Skip to main content

Questions tagged [doubly-connected-edge-list]

A doubly-connected edge list (DCEL) is an edge-centered data structure capable of maintaining incidence information of vertices, edges and faces, for example for planar maps.

2 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3 votes
0 answers
142 views

DCEL with dynamic graph

Is doubly-connected edge list a good data-structure for planar graph which vertices can be moved freely? I experienced DCEL as a very good structure when it comes to add/delete some vertex or edge. ...
JD.'s user avatar
  • 131
1 vote
0 answers
50 views

When Triangulating monotone polygons, how can diagonals be added to a DCEL in constant time?

I am working on the polygon triangulation algorithms from "Computational Geometry - Algorithms and applications 3rd ed", chapter 4. I've managed to turn polygons into y-monotone polygons ...
Jobe's user avatar
  • 11