Back to Search
Start Over
Using Constraints in Delaunay and Greedy Triangulation for Contour Lines Improvement
- Source :
- Computational Science-ICCS 2004 ISBN: 9783540221296, International Conference on Computational Science
- Publication Year :
- 2004
- Publisher :
- Springer Berlin Heidelberg, 2004.
-
Abstract
- Automatic computation of contour lines on a triangulation is a difficult problem because due to input data digitization and the type of triangulation used, some triangles can be a source of a strange behaviour of the contour lines. In this paper, we show what problems can appear in contour lines when Delaunay or greedy triangulations are used and how the contour lines can be improved using constraints in the triangulation. We improved contour lines by manually imposing constraints in a triangulation editing program. Automation of this process is a next step of our work.
- Subjects :
- Pitteway triangulation
Constrained Delaunay triangulation
Delaunay triangulation
Computer science
ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION
Triangulation (social science)
Computer Science::Computational Geometry
Minimum-weight triangulation
Bowyer–Watson algorithm
TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY
Mathematics::Category Theory
Contour line
Surface triangulation
Point set triangulation
Algorithm
Computer Science::Databases
MathematicsofComputing_DISCRETEMATHEMATICS
ComputingMethodologies_COMPUTERGRAPHICS
Subjects
Details
- ISBN :
- 978-3-540-22129-6
- ISBNs :
- 9783540221296
- Database :
- OpenAIRE
- Journal :
- Computational Science-ICCS 2004 ISBN: 9783540221296, International Conference on Computational Science
- Accession number :
- edsair.doi...........51ef63fa0515b28b56644d5988723c5c
- Full Text :
- https://doi.org/10.1007/978-3-540-25944-2_16