3 votes
Accepted

Efficiently finding point triangle inclusion when doing incremental delaunay triangulation?

These parts of the algorithm are discussed in the book Computational Geometry by de Berg et al. I will provide a summary here. Let $P$ be the set of input points. Make 3 points that are large enough ...
Discrete lizard's user avatar
  • 8,128
2 votes

Fast measurement of distance from point to mid segment?

If you use an under-/overflow-safe euclidean norm implementation along the lines of LAPACK's dnrm2, your line-to-point distance function will look something like the following Scala code: ...
DirkT's user avatar
  • 981
1 vote
Accepted

How to avoid global delaunay check in conforming triangulation?

I figured it out. The implementation of lawson's algorithm I had was incorrect, this is the right one: ...
Makogan's user avatar
  • 331
1 vote

Constrained Delaunay triangulation algorithm?

Page 7 of "FAST ALGORITHM FOR GENERATING CONSTRAINED DELAUNAY TRIANGULATIONS" (a publication on a CDT algorithm) explains the process very clearly and the figures are extremely useful.
Makogan's user avatar
  • 331
1 vote
Accepted

Constrained Delaunay triangulation algorithm?

You can find Johnathan Shewchuck's UC Berkely website here, which contains: Excellent lecture notes on Delaunay Mesh Generation sample chapters from the book "Delaunay Mesh Generation" (...
DirkT's user avatar
  • 981

Only top scored, non community-wiki answers of a minimum length are eligible