default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMousumi Dutt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Anukul Maity, Mousumi Dutt, Arindam Biswas, Bhargab B. Bhattacharya:
Approximate Cuboidization of an Orthogonal Polyhedron: A Combinatorial Approach. ICPR (32) 2024: 253-269- [c16]Anukul Maity, Mousumi Dutt, Arindam Biswas:
Finding the Straight Skeleton for 3D Orthogonal Polyhedrons: A Combinatorial Approach. ISAIM 2024: 206-217 - 2022
- [c15]Anukul Maity, Mousumi Dutt, Arindam Biswas:
Rectangularization of Digital Objects and Its Relation with Straight Skeletons. IWCIA 2022: 31-45 - 2020
- [j11]Md A. A. A. Aman, Apurba Sarkar, Mousumi Dutt, Arindam Biswas
:
A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects. Theor. Comput. Sci. 847: 103-121 (2020)
2010 – 2019
- 2019
- [c14]Eric Andres, Mousumi Dutt, Arindam Biswas, Gaëlle Largeteau-Skapin, Rita Zrour:
Digital Two-Dimensional Bijective Reflection and Associated Rotation. DGCI 2019: 3-14 - 2018
- [j10]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Shouvick Mondal:
Finding Shortest Triangular Path and its Family inside a Digital Object. Fundam. Informaticae 159(3): 297-325 (2018) - [j9]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Shouvick Mondal:
Finding Shortest Triangular Path and its Family inside a Digital Object. Fundam. Informaticae 162(1): 73-100 (2018) - [j8]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:
Finding a largest rectangle inside a digital object and rectangularization. J. Comput. Syst. Sci. 95: 204-217 (2018) - [j7]Mousumi Dutt, Eric Andres, Gaëlle Largeteau-Skapin:
Characterization and generation of straight line segments on triangular cell grid. Pattern Recognit. Lett. 103: 68-74 (2018) - [i1]Mousumi Dutt, Arindam Biswas, Benedek Nagy:
Counting of Shortest Paths in Cubic Grid. CoRR abs/1803.04190 (2018) - 2017
- [j6]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Partha Bhowmick, Bhargab B. Bhattacharya:
A linear-time algorithm to compute the triangular hull of a digital object. Discret. Appl. Math. 216: 408-423 (2017) - [c13]Mousumi Dutt, Somrita Saha, Arindam Biswas:
A Study on the Properties of 3D Digital Straight Line Segments. PReMI 2017: 212-218 - 2016
- [c12]Mousumi Dutt, Arindam Biswas:
Boundary and Shape Complexity of a Digital Object. CompIMAGE 2016: 105-117 - [c11]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:
Finding Largest Rectangle Inside a Digital Object. CTIC 2016: 157-169 - [c10]Apurba Sarkar, Arindam Biswas, Shouvick Mondal, Mousumi Dutt:
Finding Shortest Triangular Path in a Digital Object. DGCI 2016: 206-218 - 2015
- [j5]Mousumi Dutt, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
On finding a shortest isothetic path and its monotonicity inside a digital object. Ann. Math. Artif. Intell. 75(1-2): 27-51 (2015) - [c9]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:
Generation of Random Digital Curves Using Combinatorial Techniques. CALDAM 2015: 286-297 - [c8]Mousumi Dutt, Arindam Biswas, Benedek Nagy:
Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods. IWCIA 2015: 115-124 - [c7]Apurba Sarkar, Mousumi Dutt:
Construction of Sandwich Cover of Digital Objects. IWCIA 2015: 172-184 - [c6]Mousumi Dutt, Arindam Biswas, Bhargab B. Bhattacharya:
Enumeration of Shortest Isothetic Paths Inside a Digital Object. PReMI 2015: 105-115 - [c5]Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:
Generation of Random Triangular Digital Curves Using Combinatorial Techniques. PReMI 2015: 136-145 - 2014
- [j4]Mousumi Dutt, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
On the family of shortest isothetic paths in a digital object - An algorithm with applications. Comput. Vis. Image Underst. 129: 75-88 (2014) - [c4]Barnali Das, Mousumi Dutt, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
A Combinatorial Technique for Construction of Triangular Covers of Digital Objects. IWCIA 2014: 76-90 - 2013
- [j3]Mousumi Dutt, Arindam Biswas, Partha Bhowmick:
Approximate partitioning of 2D objects into orthogonally convex components. Comput. Vis. Image Underst. 117(4): 326-341 (2013) - 2012
- [c3]Mousumi Dutt, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
On Finding Shortest Isothetic Path inside a Digital Object. IWCIA 2012: 1-15 - 2011
- [j2]Mousumi Dutt, Aisharjya Sarkar, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
Efficient Word Segmentation and Baseline Localization in Handwritten Documents Using Isothetic Covers. Int. J. Digit. Libr. Syst. 2(3): 1-13 (2011) - [j1]Mousumi Dutt, Arindam Biswas, Partha Bhowmick, Bhargab B. Bhattacharya:
On finding an orthogonal convex skull of a digital object. Int. J. Imaging Syst. Technol. 21(1): 14-27 (2011) - [c2]Mousumi Dutt, Arindam Biswas, Partha Bhowmick:
ACCORD: With Approximate Covering of Convex Orthogonal Decomposition. DGCI 2011: 489-500
2000 – 2009
- 2009
- [c1]Arindam Biswas, Mousumi Dutt, Partha Bhowmick, Bhargab B. Bhattacharya:
On Finding the Orthogonal Convex Skull of a Digital Object. IWCIA Special Track on Applications 2009: 25-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
