Priya Ranjan Sinha Mahapatra

Work place: Department of Computer Science, Kalyani University, 741235, India



Research Interests: Randomized Algorithms, Computational Geometry, Analysis of Algorithms, Data Structures and Algorithms, FFT Algorithms, Computational Learning Theory, Computer systems and computational processes


Priya Ranjan Sinha Mahapatra is currently an Associate Professor at Department of Computer Science and Engineering, University of Kalyani. He received his Ph.D degree from University of Kalyani. He has numerous international and national publications in reputed journals and conferences. His research interests include Computational Geometry, Algorithms etc.

Author Articles
A Heuristic Strategy for Sub-Optimal Thick-Edged Polygonal Approximation of 2-D Planar Shape

By Sourav Saha Saptarsi Goswami Priya Ranjan Sinha Mahapatra

DOI:, Pub. Date: 8 Apr. 2018

This paper presents a heuristic approach to approximate a two-dimensional planar shape using a thick-edged polygonal representation based on some optimal criteria. The optimal criteria primarily focus on derivation of minimal thickness for an edge of the polygonal shape representation to handle noisy contour. Vertices of the shape-approximating polygon are extracted through a heuristic exploration using a digital geometric approach in order to find optimally thick-line to represent a discrete curve. The merit of such strategies depends on how efficiently a polygon having minimal number of vertices can be generated with modest computational complexity as a meaningful representation of a shape without loss of significant visual characteristics. The performance of the proposed frame- work is comparable to the existing schemes based on extensive empirical study with standard data set.

[...] Read more.
Other Articles