4
$\begingroup$

I'm working on my thesis dealing with pathfinding over Delaunay triangulations. I have an algorithm that has running time in time proportional to the degree of a vertex. Are there any properties or upper bounds on the degree of vertices in a Delaunay (or Constrained Delaunay) triangulation?

$\endgroup$
3
  • $\begingroup$ Sariel's book sarielhp.org/book ? I did an REU project on them a decade ago if you want some examples outside of computational geometry orion.math.iastate.edu/reu/2001/voronoi_paper/voronoi.pdf $\endgroup$ Commented Feb 10, 2014 at 22:12
  • $\begingroup$ In the plane, in 3-space, or in higher dimensions? $\endgroup$
    – Jeffε
    Commented Feb 11, 2014 at 1:56
  • $\begingroup$ The algorithm I am building is only over 2-space $\endgroup$
    – zaloo
    Commented Feb 11, 2014 at 2:03

2 Answers 2

4
$\begingroup$

(In 2-space,) a Delaunay triangulation is a planar graph. All planar graphs have average degree at most 6. So, many (all?) operations that depend on vertex degree of a Delaunay triangulation will run in $O(1)$ expected time.

$\endgroup$
1
  • 1
    $\begingroup$ That's amazing, exactly what I needed. $\endgroup$
    – zaloo
    Commented Feb 11, 2014 at 2:05
2
$\begingroup$

Here's a theta bound on the expected value of the maximum degree of any vertex in a DT:

$\Theta (\log n / \log \log n)$

Here's the paper: http://www.ics.uci.edu/~eppstein/pubs/BerEppYao-IJCGA-91.pdf. If anyone else finds other properties, let me know!

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.