Gift-wrapping based preimage computation algorithmGERARD, Yan; COEURJOLLY, David; FESCHET, Fabien et al.Pattern recognition. 2009, Vol 42, Num 10, pp 2255-2264, issn 0031-3203, 10 p.Article

Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss mapUSCKA-WEHLOU, Hanna.Pattern recognition. 2009, Vol 42, Num 10, pp 2247-2254, issn 0031-3203, 8 p.Article

Distances with neighbourhood sequences in cubic and triangular gridsNAGY, Benedek.Pattern recognition letters. 2007, Vol 28, Num 1, pp 99-109, issn 0167-8655, 11 p.Article

Fast polygonal approximation of digital curves using relaxed straightness propertiesBHOWMICK, Partha; BHATTACHARYA, Bhargab B.IEEE transactions on pattern analysis and machine intelligence. 2007, Vol 29, Num 9, pp 1590-1602, issn 0162-8828, 13 p.Article

The t-cost distance in digital geometry = La distance t-coût en géométrie numériqueDAS, P. P; JAYANTA MUKHERJEE; CHATTERJI, B. N et al.Information sciences. 1992, Vol 59, Num 1-2, pp 1-20, issn 0020-0255Article

Tangential cover for thick digital curvesFAURE, Alexandre; BUZER, Lilian; FESCHET, Fabien et al.Pattern recognition. 2009, Vol 42, Num 10, pp 2279-2287, issn 0031-3203, 9 p.Article

Leftmost one computation on meshes with row broadcastingGURLA, H.Information processing letters. 1993, Vol 47, Num 5, pp 261-266, issn 0020-0190Article

Oriented matroids as a foundation for space in GIS : Topology and spatial databasesSTELL, John; WEBSTER, Julian.Computers, environment and urban systems. 2007, Vol 31, Num 4, pp 379-392, issn 0198-9715, 14 p.Article

Polygonal representations of digital setsECKHARDT, Ulrich; REITER, Helene.Algorithmica. 2004, Vol 38, Num 1, pp 5-23, issn 0178-4617, 19 p.Article

Chain code proabilities and optimal length estimators for digitized three-dimensional curvesKIRYATI, N; KÜBLER, O.Pattern recognition. 1995, Vol 28, Num 3, pp 361-372, issn 0031-3203Article

A coding scheme for certain sets of digital curvesZUNIC, J.Pattern recognition letters. 1995, Vol 16, Num 1, pp 97-104, issn 0167-8655Article

A generalized preimage for the digital analytical hyperplane recognitionDEXET, M; ANDRES, E.Discrete applied mathematics. 2009, Vol 157, Num 3, pp 476-489, issn 0166-218X, 14 p.Conference Paper

Surface area estimation of digitized 3D objects using quasi-Monte Carlo methodsLIU, Yu-Shen; JING YI; HU ZHANG et al.Pattern recognition. 2010, Vol 43, Num 11, pp 3900-3909, issn 0031-3203, 10 p.Article

Aspects of computational geometry in gamut mapping implementationsKÜPPER, Dennis; SIMON, Klaus.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7528, issn 0277-786X, isbn 978-0-8194-7921-1 0-8194-7921-7, 1Vol, 75280J.1-75280J.10Conference Paper

Algorithms that measure parallelism and concurrency of lines in digital imagesVEELAERT, P.SPIE proceedings series. 1999, pp 69-79, isbn 0-8194-3297-0Conference Paper

Digital lines with irrational slopesUSCKA-WEHLOU, Hanna.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 157-169, issn 0304-3975, 13 p.Article

Finding shortest path with neighbourhood sequences in triangular gridsNAGY, Benedek.International symposium on image and signal processing and analysis. 2001, pp 55-60, isbn 953-96769-4-0Conference Paper

On errors in calculated moments of convex sets using digital imagesKLETTE, R; ZUNIC, J.SPIE proceedings series. 1999, pp 105-116, isbn 0-8194-3297-0Conference Paper

Etude et reconnaissance des droites et plans discrets = Study and recognition of digital straight lines and planesDebled-Rennesson, Isabelle; Reveilles, J.-P.1995, 220 p.Thesis

Adaptive Algorithms for Planar Convex Hull Problems : Foundations of Computer Science - Mathematical Foundations and Apllications of Algorithms and Computer ScienceAHN, Hee-Kap; OKAMOTO, Yoshio.IEICE transactions on information and systems. 2011, Vol 94, Num 2, pp 182-189, issn 0916-8532, 8 p.Article

Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic gridsSTRAND, Robin; NAGY, Benedek.Discrete applied mathematics. 2009, Vol 157, Num 16, pp 3386-3400, issn 0166-218X, 15 p.Article

Multigrid convergent principal curvature estimators in digital geometryCOEURJOLLY, David; LACHAUD, Jacques-Olivier; LEVALLOIS, Jérémy et al.Computer vision and image understanding (Print). 2014, Vol 129, pp 27-41, issn 1077-3142, 15 p.Article

On Linear-Sized Farthest-Color Voronoi Diagrams : Foundations of Computer Science - Mathematical Foundations and Applications of Computer Science and AlgorithmsSANG WON BAE.IEICE transactions on information and systems. 2012, Vol 95, Num 3, pp 731-736, issn 0916-8532, 6 p.Article

Approximating Euclidean circles by neighbourhood sequences in a hexagonal gridNAGY, Benedek; STRAND, Robin.Theoretical computer science. 2011, Vol 412, Num 15, pp 1364-1377, issn 0304-3975, 14 p.Article

Measure of circularity for parts of digital boundaries and its fast computationROUSSILLON, Tristan; SIVIGNON, Isabelle; TOUGNE, Laure et al.Pattern recognition. 2010, Vol 43, Num 1, pp 37-46, issn 0031-3203, 10 p.Article