Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Claudia Calabrese
Berdakh Abibullaev
Kaizhi Qian
Bhuvana, J.
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
MOUSUMI DUTT
Author Info
Open Visualization
Name
Affiliation
Papers
MOUSUMI DUTT
Department of Information Technology, Bengal Engineering and Science University, Shibpur, Howrah, India
23
Collaborators
Citations
PageRank
16
25
8.54
Referers
Referees
References
17
284
261
Search Limit
100
284
Publications (23 rows)
Collaborators (16 rows)
Referers (17 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects.
0
0.34
2020
Counting of Shortest Paths in Cubic Grid.
0
0.34
2018
Finding Shortest Triangular Path and its Family inside a Digital Object.
1
0.35
2018
Finding a largest rectangle inside a digital object and rectangularization.
0
0.34
2018
Characterization and generation of straight line segments on triangular cell grid.
2
0.38
2018
A linear-time algorithm to compute the triangular hull of a digital object.
1
0.35
2017
Finding Shortest Triangular Path in a Digital Object.
0
0.34
2016
Boundary And Shape Complexity Of A Digital Object
0
0.34
2016
Finding Largest Rectangle Inside a Digital Object.
1
0.37
2016
On finding a shortest isothetic path and its monotonicity inside a digital object
4
0.52
2015
Enumeration of Shortest Isothetic Paths Inside a Digital Object
1
0.36
2015
Generation of Random Triangular Digital Curves Using Combinatorial Techniques
0
0.34
2015
Generation of Random Digital Curves Using Combinatorial Techniques.
1
0.39
2015
Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods.
2
0.37
2015
Construction of Sandwich Cover of Digital Objects.
0
0.34
2015
On the family of shortest isothetic paths in a digital object - An algorithm with applications.
1
0.36
2014
A Combinatorial Technique For Construction Of Triangular Covers Of Digital Objects
3
0.46
2014
Approximate partitioning of 2D objects into orthogonally convex components
0
0.34
2013
On Finding Shortest Isothetic Path inside a Digital Object.
6
0.54
2012
ACCORD: with approximate covering of convex orthogonal decomposition
1
0.35
2011
Efficient Word Segmentation and Baseline Localization in Handwritten Documents Using Isothetic Covers
0
0.34
2011
On Finding An Orthogonal Convex Skull Of A Digital Object
1
0.37
2011
On Finding the Orthogonal Convex Skull of a Digital Object.
0
0.34
2009
1