Asish Mukhopadhyay

2008
45	EE	Robert L. Scot Drysdale, Asish Mukhopadhyay: An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett. 105(2): 47-51 (2008)
44	EE	Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Binay K. Bhattacharya: On intersecting a set of parallel line segments with a convex polygon of minimum area. Inf. Process. Lett. 105(2): 58-64 (2008)
2007
43		Asish Mukhopadhyay, Eugene Greene: On a Geometric Approach to the Segment Sum Problem and Its Generalization. CCCG 2007: 265-268
42		Asish Mukhopadhyay, Eugene Greene: The Ordinary Line Problem Revisited. CCCG 2007: 61-64
41	EE	Asish Mukhopadhyay, Augustus Das: Curve reconstruction in the presence of noise. CGIV 2007: 177-182
40	EE	Asish Mukhopadhyay, Eugene Greene, S. V. Rao: On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. ICCSA (1) 2007: 41-54
2006
39	EE	Asish Mukhopadhyay, Robert L. Scot Drysdale: An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. CCCG 2006
38	EE	Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere: On the All-Farthest-Segments problem for a planar set of points. Inf. Process. Lett. 100(3): 120-123 (2006)
2004
37		Pawel Kosicki, Asish Mukhopadhyay: Encoding Quadrilateral Meshes in 2.40 bits per Vertex. ICVGIP 2004: 89-94
2003
36		Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao: Computing the Closest Point to a Circle. CCCG 2003: 132-135
35		Anna Medvedeva, Asish Mukhopadhyay: An Implementation of a linear time algorithm for computing the minimum perimeter triangle enclosing a convex polygon. CCCG 2003: 25-28
34		Asish Mukhopadhyay, Quanbin Jing: Encoding Quadrilateral Meshes. CCCG 2003: 60-63
33	EE	Pinaki Mitra, Asish Mukhopadhyay: Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. ICCSA (3) 2003: 787-796
32	EE	Asish Mukhopadhyay, S. V. Rao: Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) 2003: 797-806
31	EE	Asish Mukhopadhyay, S. V. Rao: On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geometry Appl. 13(3): 257-271 (2003)
30	EE	Asish Mukhopadhyay: Using simplicial partitions to determine a closest point to a query line. Pattern Recognition Letters 24(12): 1915-1920 (2003)
2002
29	EE	Asish Mukhopadhyay: Using simplicial partitions to determine a closest point to a query line. CCCG 2002: 10-12
28	EE	Binay K. Bhattacharya, Asish Mukhopadhyay: On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96
27		Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan: Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002)
2001
26	EE	Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
25	EE	S. V. Rao, Asish Mukhopadhyay: Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognition 34(11): 2163-2172 (2001)
2000
24	EE	S. V. Rao, Asish Mukhopadhyay: Efficient Algorithms for Computing the beta-spectrum. CCCG 2000
23	EE	Asish Mukhopadhyay, S. V. Rao: Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65(3): 285-289 (2000)
22		G. Srinivasaraghavan, Asish Mukhopadhyay: Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geometry Appl. 10(1): 79-102 (2000)
1999
21	EE	Olivier Devillers, Asish Mukhopadhyay: Finding an ordinary conic and an ordinary hyperplane CoRR cs.CG/9909017: (1999)
20		Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. Int. J. Comput. Geometry Appl. 9(1): 81- (1999)
19		Olivier Devillers, Asish Mukhopadhyay: Finding an Ordinary Conic and an Ordinary Hyperplane. Nord. J. Comput. 6(4): 462-468 (1999)
1997
18		S. V. Rao, Asish Mukhopadhyay: Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383
17	EE	Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou: Voronoi Diagrams for Direction-Sensitive Distances. Symposium on Computational Geometry 1997: 418-420
16		Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu: On the Ordinary Line Problem in Computational Geometry. Nord. J. Comput. 4(4): 330-341 (1997)
1996
15		Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. J. Algorithms 20(2): 244-267 (1996)
1995
14		Binay K. Bhattacharya, Asish Mukhopadhyay: Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31
13		Andrzej Lingas, Asish Mukhopadhyay: A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238
1994
12		Shreesh Jadhav, Asish Mukhopadhyay: Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Discrete & Computational Geometry 12: 291-312 (1994)
11		G. Srinivasaraghavan, Asish Mukhopadhyay: A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. Discrete & Computational Geometry 12: 65-82 (1994)
1993
10		Asish Mukhopadhyay, Chanchal Kumar, Binay K. Bhattacharya: Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments. CCCG 1993: 169-174
9		G. Srinivasaraghavan, Asish Mukhopadhyay: On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG 1993: 315-320
8	EE	Shreesh Jadhav, Asish Mukhopadhyay: Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Symposium on Computational Geometry 1993: 83-90
1992
7		Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya: An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons. FSTTCS 1992: 92-103
1991
6	EE	Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert: Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). Symposium on Computational Geometry 1991: 81-88
5		Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. WADS 1991: 412-424
4	EE	B. S. S. Pradhan, Asish Mukhopadhyay: Adaptive cell division for ray tracing. Computers & Graphics 15(4): 549-552 (1991)
1987
3		Asish Mukhopadhyay: A Solution to the Polynomial Hensel Code Conversion Problem. IEEE Trans. Computers 36(5): 634-637 (1987)
1985
2		Asish Mukhopadhyay, Vangalur S. Alagar: Exact Computation of the Characteristic Polynomial of an Integer Matrix. AAECC 1985: 316-324
1		Asish Mukhopadhyay: A Solution to the Polynominal Hensel-Code Conversion Problem. European Conference on Computer Algebra (2) 1985: 327

Coauthor Index

1	Alok Aggrawal	[16]
2	Oswin Aichholzer	[17]
3	Vangalur S. Alagar (Vasu S. Alagar)	[2]
4	Franz Aurenhammer	[17]
5	Binay K. Bhattacharya	[5] [6] [7] [10] [14] [15] [20] [26] [27] [28] [44]
6	Samidh Chatterjee	[38]
7	Danny Z. Chen	[17]
8	Augustus Das	[41]
9	Gautam Das	[27]
10	Olivier Devillers	[19] [21]
11	Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III)	[39] [45]
12	Eugene Greene	[40] [42] [43] [44]
13	Ravi Mohan Hosabettu	[16]
14	Shreesh Jadhav	[6] [7] [8] [12] [15]
15	Quanbin Jing	[34]
16	Pawel Kosicki	[37]
17	Chanchal Kumar	[10] [44]
18	Benjamin J. Lafreniere	[38]
19	D. T. Lee	[17]
20	Andrzej Lingas	[13]
21	Anna Medvedeva	[35]
22	Pinaki Mitra	[33] [36]
23	Giri Narasimhan	[26] [27]
24	Evanthia Papadopoulou	[17]
25	B. S. S. Pradhan	[4]
26	S. V. Rao	[18] [23] [24] [25] [31] [32] [36] [40]
27	Jean-Marc Robert	[6]
28	G. Srinivasaraghavan	[9] [11] [22]
29	Godfried T. Toussaint	[5] [20]

Colors in the list of coauthors