DGtal  0.9.3beta
Bibliography
[1]

Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, and Alireza Zarei. Streaming algorithms for line simplification. In SCG '07: Symp. on Comput. geometry, pages 175–183. ACM, 2007.

[2]

D Adalsteinsson and J.A Sethian. The fast construction of extension velocities in level set methods. Journal of Computational Physics, 148(1):2 – 22, 1999.

[3]

Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, and Yusu Wang. Near-linear time approximation algorithms for curve simplification. Algorithmica, 42(3-4):203–219, 2005.

[4]

A. M. Andrew. Another efficient algorithm for convex hulls in two dimensions. Information Processing Letters, 9(5):216–219, 1979.

[5]

F. Aurenhammer. Power Diagrams: Properties, Algorithms, and Applications. SIAM Journal on Computing, 16:78–96, 1987.

[6]

F. Avnaim, J.-D. Boissonnat, O. Devillers, F.P. Preparata, and M. Yvinec. Evaluating signs of determinants using single-precision arithmetic. Algorithmica, 17(2):111–132, 1997.

[7]

Serge Belongie. Rodrigues' rotation formula. From MathWorld–A Wolfram Web Resource, created by Eric W. Weisstein.

[8]

G. Bertrand and M. Couprie. Géométrie discrète et images numériques, chapter 8. Transformations topologiques discrètes. Traité IC2. Hermès, 2007. In french.

[9]

G. Borgefors. Distance transformations in digital images. Computer Vision, Graphics, and Image Processing, 34(3):344–371, jun 1986.

[10]

Alexandre Boulch and Renaud Marlet. Fast and robust normal estimation for point clouds with sharp features. Comput. Graph. Forum, 31(5):1765–1774, 2012.

[11]

H. Breu, J. Gil, D. Kirkpatrick, and M. Werman. Linear time Euclidean distance transform algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(5):529–533, 1995.

[12]

F. Cazals and M. Pouget. Estimating differential quantities using polynomial fitting of osculating jets. Computer Aided Geometric Design, 22(2):121–146, 2005.

[13]

CGal: Computational geometry algorithms library, http://www.cgal.org.

[14]

W. S. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments. In ISAAC '92: Symp. on Algorithms and Computation, pages 378–387. Springer-Verlag, 1992.

[15]

E. Charrier and L. Buzer. An efficient and quasi-linear worst-case time algorithm for digital plane recognition. In Proc. Int. Conf. Discrete Geometry for Computer Imagery (DGCI'2008), Lyon, France, volume 4992 of LNCS, pages 346–357. Springer, 2008.

[16]

Emilie Charrier and Lilian Buzer. Approximating a real number by a rational number with a limited denominator: A geometric approach. Discrete Applied Mathematics, 157(16):3473 – 3484, 2009.

[17]

D. Coeurjolly and A. Montanvert. Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(3):437–448, mar 2007.

[18]

David Coeurjolly, Jacques-Olivier Lachaud, and Jérémy Levallois. Integral based Curvature Estimators in Digital Geometry. In B. Medrano R. Gonzalez-Diaz, M.J. Jimenez, editor, 17th International Conference on Discrete Geometry for Computer Imagery (DGCI 2013), Lecture Notes in Computer Science, pages 215–227. Springer Verlag, March 2013.

[19]

David Coeurjolly, Jacques-Olivier Lachaud, and Jérémy Levallois. Multigrid Convergent Principal Curvature Estimators in Digital Geometry. Computer Vision and Image Understanding, June 2014.

[20]

D Coeurjolly. Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces. Thèse, Université Lumière Lyon 2, Laboratoire ERIC, 2002.

[21]

David Coeurjolly. Distance Transformation, Reverse Distance Transformation and Discrete Medial Axis on Toric Spaces. In International Conference on Pattern Recognition, page 3541, Tampa, United States, December 2008.

[22]

David Coeurjolly. Fast and Accurate Approximation of Digital Shape Thickness Distribution in Arbitrary Dimension . Computer Vision and Image Understanding, 116(12):1159–1167, December 2012.

[23]

David Coeurjolly. 2D Subquadratic Separable Distance Transformation for Path-Based Norms. In 18th International Conference on Discrete Geometry for Computer Imagery, LNCS. Springer, September 2014.

[24]

L. Cuel, J.-O. Lachaud, and B. Thibert. Voronoi-based geometry estimator for 3d digital surfaces. In Proc. Int. Conf. Discrete Geometry for Computer Imagery (DGCI'2014), Sienna, Italy, Lecture Notes in Computer Science, 2014. Submitted.

[25]

P.E. Danielsson. Euclidean distance mapping. Computer Graphics and image processing, 14(3):227–248, 1980.

[26]

Fernando de Goes, Keenan Crane, Mathieu Desbrun, Peter Schröder, and others. Digital geometry processing with discrete exterior calculus. In ACM SIGGRAPH 2013 Courses, page 7. ACM, 2013.

[27]

I. Debled-Renesson and J.-P. Reveillès. A linear algorithm for segmentation of discrete curves. International Journal of Pattern Recognition and Artificial Intelligence, 9:635–662, 1995.

[28]

I. Debled-Rennesson, F. Feschet, and J. Rouyer-Degli. Blurred segments decomposition in linear time. In E. Andres, G. Damiand, and P. Lienhardt, editors, Proceedings of the 12th International Conference on Discrete Geometry for Computer Imagery, volume 3429 of LNCS, pages 371–382, Poitiers, France, April 2005. Springer-Verlag.

[29]

I. Debled-Rennesson, J-L. Rémy, and J. Rouyer-Degli. Linear Segmentation of Discrete Curves into Fuzzy Segments. Discrete Applied Mathematics, 151(1-3):122–137, October 2005.

[30]

Mathieu Desbrun, Anil N Hirani, Melvin Leok, and Jerrold E Marsden. Discrete exterior calculus. arXiv preprint math/0508341, 2005.

[31]

H. Edelsbrunner, D. Kirkpatrick, and R. Seidel. On the shape of a set of points in the plane. IEEE Transactions on Information Theory, 29(4):551–559, July 1983.

[32]

Alexandre Faure and Fabien Feschet. Tangential cover for thick digital curves. In DGCI 2008, volume 4992 of LNCS, pages 368–369. Springer-Verlag, 2008.

[33]

Fabien Feschet and Laure Tougne. Optimal time computation of the tangent of a discrete curve: Application to the curvature. In Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery, DCGI '99, pages 31–40, London, UK, UK, 1999. Springer-Verlag.

[34]

Y. Gerard, I. Debled-Rennesson, and P. Zimmermann. An elementary digital plane recognition algorithm. Discrete Applied Mathematics, 151(1–3):169–183, 2005.

[35]

R.L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132–133, 1972.

[36]

T. Hirata. A unified linear-time algorithm for computing distance maps. Information Processing Letters, 58:129, 1996.

[37]

Imagene, Generic digital Image library. https://gforge.liris.cnrs.frs/projects/imagene.

[38]

B. Kerautret and J.-O. Lachaud. Curvature Estimation along Noisy Digital Contours by Approximate Global Optimization. Pattern Recognition, 42(10):2265–2278, October 2009.

[39]

Bertrand Kerautret and Jacques-Olivier Lachaud. Meaningful Scales Detection along Digital Contours for Unsupervised Local Noise Estimation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(12):2379–2392, December 2012.

[40]

J.-O. Lachaud and M. Said. Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line. Discrete Applied Mathematics, 161:2293–2315, oct 2013.

[41]

Jacques-Olivier Lachaud, Anne Vialard, and François de Vieilleville. Fast, accurate and convergent tangent estimation on digital contours. Image Vision Comput., 25(10):1572–1587, October 2007.

[42]

J.-O. Lachaud. Coding cells of digital spaces: a framework to write generic digital topology algorithms. In A. Del Lungo, V. Di Gesù, and A. Kuba, editors, Proc. Int. Work. Combinatorial Image Analysis (IWCIA'2003), Palermo, Italy, volume 12 of ENDM. Elsevier, 2003.

[43]

A. Lenoir, R. Malgouyres, and M. Revenu. Fast computation of the normal vector field of the surface of a 3D discrete object. 6th Discrete Geometry for Computer Imagery, pages 101–112, 1996.

[44]

T. Lewiner, V. Mello, A. Peixoto, S. Pesco, and H. Lopes. Fast generation of pointerless octree duals. Computer Graphics, (5):1–9.

[45]

Buzer Lilian. Computing multiple convex hulls of a simple polygonal chain in linear time. In 23rd European Workshop on Computational Geometry, pages 114–117, 2007.

[46]

C. Maurer, R. Qi, and V. Raghavan. A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions. IEEE Trans. Pattern Analysis and Machine Intelligence, 25:265–270, 2003.

[47]

Avraham A. Melkman. On-line construction of the convex hull of a simple polyline. Inf. Process. Lett., 25(1):11–12, April 1987.

[48]

Avraham A. Melkman. On-line Construction of the Convex Hull of a Simple Polyline. Inf. Process. Lett., 25(1):11–12, April 1987.

[49]

Nicolas Mellado, Gaël Guennebaud, Pascal Barla, Patrick Reuter, and Christophe Schlick. Growing least squares for the analysis of manifolds in scale-space. In Computer Graphics Forum, volume 31, pages 1691–1701. Wiley Online Library, 2012.

[50]

Q. Mérigot, M. Ovsjanikov, and L. Guibas. Voronoi-based curvature and feature estimation from point clouds. IEEE Transactions on Visualization and Computer Graphics, 17(6):743–756, 2011.

[51]

Stanley Osher and Ronald Fedkiw. Level Set Methods and Dynamic Implicit Surfaces. Springer, 2003 edition, November 2003.

[52]

L. Papier and J. Françon. Evalutation de la normale au bord d'un objet discret 3D. Revue de CFAO et d'informatique graphique, 13:205–226, 1998.

[53]

Min Ki Park, Seung Joo Lee, and Kwan H. Lee. Multi-scale tensor voting for feature extraction from unstructured point clouds. Graphical Models, 74(4):197–208, 2012.

[54]

H Pottmann, J Wallner, Y Yang, Y Lai, and S Hu. Principal curvatures from the integral invariant viewpoint. Computer Aided Geometric Design, 24(8-9):428–442, 2007.

[55]

H Pottmann, J Wallner, Q Huang, and Y Yang. Integral invariants for robust geometry processing. Computer Aided Geometric Design, 26(1):37–60, 2009.

[56]

I. Ragnemalm. The Euclidean Distance Transform. PhD thesis, 1993.

[57]

J.-P. Reveillès. Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d'etat, Université Louis Pasteur, Strasbourg, France, 1991. In french.

[58]

A. Rosenfeld and J.-L. Pfaltz. Sequential operations in digital picture processing. Journal of the ACM (JACM), vol:13pp471–494, 1966.

[59]

A. Rosenfeld and J. Pfaltz. Distance functions on digital pictures. Pattern Recognition, 1:33–61, 1968.

[60]

Tristan Roussillon and Isabelle Sivignon. Faithful polygonal representation of the convex and concave parts of a digital curve. Pattern Recognition, 44(10-11):2693–2700, October 2011.

[61]

Tristan Roussillon. An arithmetical characterization of the convex hull of digital straight segments. In Elena Barcucci, Andrea Frosini, and Simone Rinaldi, editors, Discrete Geometry for Computer Imagery, volume 8668 of Lecture Notes in Computer Science, pages 150–161. Springer International Publishing, 2014.

[62]

M. Said and J.-O. Lachaud. Computing the characteristics of a subsegment of a digital straight line in logarithmic time. In Proc. International Conference on Discrete Geometry for Computer Imagery (DGCI2011), volume 6607 of Lecture Notes in Computer Science, pages 320–332, Nancy, France, apr 2011. Springer.

[63]

M. Said, J.-O. Lachaud, and F. Feschet. Multiscale Discrete Geometry. In Proc. International Conference on Discrete Geometry for Computer Imagery (DGCI2009), volume 5810 of Lecture Notes in Computer Science, pages 118–131, Montréal, Québec Canada, 2009. Springer.

[64]

T. Saito and J.-I. Toriwaki. New algorithms for Euclidean distance transformations of an $n$-dimensional digitized picture with applications. Pattern Recognition, 27:1551–1565, 1994.

[65]

J. A. Sethian. Fast marching methods. SIAM Review, 41:199–235, 1998.

[66]

Michael Ian Shamos. Computational geometry. 1978.

[67]

Isabelle Sivignon. A near-linear time guaranteed algorithm for digital curve simplification under the fréchet distance. In Discrete Geometry for Computer Imagery, volume 6607 of Lecture Notes in Computer Science, pages 333–345. Springer Berlin Heidelberg, 2011.

[68]

Isabelle Sivignon. Walking in the farey fan to compute the characteristics of a discrete straight line subsegment. In Discrete Geometry for Computer Imagery, volume 7749 of Lecture Notes in Computer Science, pages 23–34. Springer-Verlag, 2013.

[69]

Isabelle Sivignon. Algorithms for fast digital straight segments union. In Elena Barcucci, Andrea Frosini, and Simone Rinaldi, editors, Discrete Geometry for Computer Imagery, volume 8668 of Lecture Notes in Computer Science, pages 344–357. Springer International Publishing, 2014.

[70]

Godfried T. Toussaint and David Avis. On a convex hull algorithm for polygons and its application to triangulation problems. Pattern Recognition, 15(1):23 – 29, 1982.