TIPS: on finding a tight isothetic polygonal shape covering a 2d object

Authors:
Arindam Biswas;Partha Bhowmick;Bhargab B. Bhattacharya
Affiliations:
Computer Science and Technology Department, Bengal Engineering and Science University, Shibpur, Howrah, India;Computer Science and Technology Department, Bengal Engineering and Science University, Shibpur, Howrah, India;Center for Soft Computing Research, Indian Statistical Institute, Kolkata, India
Venue:
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Year:
2005

Citing 6
Cited 10

Real-time robot motion planning using rasterizing computer graphics hardware

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Safety zone problem

Journal of Algorithms
Case Generation Using Rough Sets with Fuzzy Representation

IEEE Transactions on Knowledge and Data Engineering
Inner and outer approximations of polytopes using boxes

Computational Geometry: Theory and Applications
Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing

Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing
Dimension Reduction Based on Rough Set in Image Mining

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology

Finding the orthogonal hull of a digital object: a combinatorial approach

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Construction of isothetic covers of a digital object: A combinatorial approach

Journal of Visual Communication and Image Representation
ACCORD: with approximate covering of convex orthogonal decomposition

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Construction of 3D orthogonal cover of a digital object

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Isothetic polygonal approximations of a 2d object on generalized grid

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
MUSC: multigrid shape codes and their applications to image retrieval

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
PACE: polygonal approximation of thick digital curves using cellular envelope

ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane

Information Sciences: an International Journal
Understanding Digital Documents Using Gestalt Properties of Isothetic Components

International Journal of Digital Library Systems
Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of constructing a tight isothetic outer (or inner) polygon covering an arbitrarily shaped 2D object on a background grid, is addressed in this paper, and a novel algorithm is proposed. Such covers have many applications to image mining, rough sets, computational geometry, and robotics. Designing efficient algorithms for these cover problems was an open problem in the literature. The elegance of the proposed algorithm lies in utilizing the inherent combinatoral properties of the relative arrangement of the object and the grid lines. The shape and the relative error of the polygonal cover can be controlled by changing the granularity of the grid. Experimental results on various complex objects with variable grid sizes have been reported to demonstrate the versatility, correctness, and speed of the algorithm.