Some theoretical challenges in digital geometry: A perspective

Authors:
Tetsuo Asano;Valentin E. Brimkov;Reneta P. Barneva
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, ISHIKAWA 923-1292, Japan;Mathematics Department, SUNY Buffalo State College, Buffalo, NY 14222, USA;Department of Computer Science, SUNY Fredonia, NY 14063, USA
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 34
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Fast parallel and serial approximate string matching

Journal of Algorithms
Text algorithms

Text algorithms
A unified linear-time algorithm for computing distance maps

Information Processing Letters
Real data—integer solution problems with the Blum-Shub-Smale computational model

Journal of Complexity
Optimal parallel two dimension text searching on a CREW PRAM4

Information and Computation
On the Topological Properties of Quantized Spaces, I. The Notion of Dimension

Journal of the ACM (JACM)
Classifying the literature related to computer vision and image analysis

Computer Vision and Image Understanding
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Linear Time Euclidean Distance Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Power of Non-Rectilinear Holes

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Polyhedra generation from lattice points

DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Digital Geometry: Geometric Methods for Digital Picture Analysis

Digital Geometry: Geometric Methods for Digital Picture Analysis
Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces

Algorithmica
Digital straightness: a review

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
On the min DSS problem of closed discrete curves

Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
The Image Processing Handbook, Fifth Edition (Image Processing Handbook)

The Image Processing Handbook, Fifth Edition (Image Processing Handbook)
Digital planarity-A review

Discrete Applied Mathematics
Border and Surface Tracing - Theoretical Foundations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge

SIAM Journal on Computing
On the polyhedral complexity of the integer points in a hyperball

Theoretical Computer Science
Finding a minimum medial axis of a discrete shape is NP-hard

Theoretical Computer Science
Minimum decomposition of a digital surface into digital plane segments is NP-hard

Discrete Applied Mathematics
Digitization scheme that assures faithful reconstruction of plane figures

Pattern Recognition
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Scaling of plane figures that assures faithful digitization

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Reconstructing a matrix with a given list of coefficients and prescribed row and column sums is NP-hard

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Polyhedrization of discrete convex volumes

ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Maximal digital straight segments and convergence of discrete geometric estimators

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Optimization schemes for the reversible discrete volume polyhedrization using marching cubes simplification

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Computational aspects of digital plane and hyperplane recognition

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Complexity and approximability issues in combinatorial image analysis

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Computational-geometry approach to digital image contour extraction

Transactions on computational science XIII
Mollified zone diagrams and their computation

Transactions on Computational Science XIV

Quantified Score

Hi-index	0.04

Visualization

Abstract

In recent years image analysis has become a research field of exceptional significance, due to its relevance to real life problems in important societal and governmental sectors, such as medicine, defense, and security. The explicit purpose of the present Perspective is to suggest a number of strategic objectives for theoretical research, with an emphasis on the combinatorial approach in image analysis. Most of the proposed objectives relate to the need to make the theoretical foundations of combinatorial image analysis better integrated within a number of well-established subjects of theoretical computer science and discrete applied mathematics, such as the theory of algorithms and problem complexity, combinatorial optimization and polyhedral combinatorics, integer and linear programming, and computational geometry.