Asish Mukhopadhyay

	2012
58		Asish Mukhopadhyay, Eugene Greene: The ordinary line problem revisited. Comput. Geom. 45(3): 127-130 (2012)
	2011
57		Md. Shafiul Alam, Asish Mukhopadhyay: Algorithms for the Problems of Length-Constrained Heaviest Segments CoRR abs/1108.4972: (2011)
56		Satish Panigrahi, Asish Mukhopadhyay: Some Geometric Problems on OMTSE Optoelectronic Computer. Scalable Computing: Practice and Experience 12(2): (2011)
	2010
55		Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao: Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210
54		Md. Shafiul Alam, Asish Mukhopadhyay: A new algorithm and improved lower bound for point placement on a line in two rounds. CCCG 2010: 229-232
53		Md. Shafiul Alam, Asish Mukhopadhyay: Constraint Representation for Autonomous Camera. CGVR 2010: 17-21
52		Asish Mukhopadhyay, Animesh Sarker, Tom Switzer: Approximate Ellipsoid in the Streaming Model. COCOA (2) 2010: 401-413
	2009
51		Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sarker: Generalized jewels and the point placement problem. CCCG 2009: 45-48
50		Hamid Zarrabi-Zadeh, Asish Mukhopadhyay: Streaming 1-Center with Outliers in High Dimensions. CCCG 2009: 83-86
49		Prosenjit Bose, Asish Mukhopadhyay: Editorial CCCG 2005. Comput. Geom. 42(5): 363 (2009)
48		Asish Mukhopadhyay, Eugene Greene, S. V. Rao: On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area. Int. J. Comput. Geometry Appl. 19(6): 557-577 (2009)
	2008
47		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)
46		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
45		Asish Mukhopadhyay, Eugene Greene: On a Geometric Approach to the Segment Sum Problem and Its Generalization. CCCG 2007: 265-268
44		Asish Mukhopadhyay, Eugene Greene: The Ordinary Line Problem Revisited. CCCG 2007: 61-64
43		Asish Mukhopadhyay, Augustus Das: Curve reconstruction in the presence of noise. CGIV 2007: 177-182
42		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
41		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
40		Asish Mukhopadhyay, Augustus Das: An RNG-based heuristic for curve reconstruction. ISVD 2006: 246-251
39		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
38		Pawel Kosicki, Asish Mukhopadhyay: Encoding Quadrilateral Meshes in 2.40 bits per Vertex. ICVGIP 2004: 89-94
	2003
37		Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao: Computing the Closest Point to a Circle. CCCG 2003: 132-135
36		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
35		Asish Mukhopadhyay, Quanbin Jing: Encoding Quadrilateral Meshes. CCCG 2003: 60-63
34		Pinaki Mitra, Asish Mukhopadhyay: Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions. ICCSA (3) 2003: 787-796
33		Asish Mukhopadhyay, S. V. Rao: Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation. ICCSA (3) 2003: 797-806
32		Asish Mukhopadhyay, S. V. Rao: On Computing a Largest Empty Arbitrarily Oriented Rectangle. Int. J. Comput. Geometry Appl. 13(3): 257-271 (2003)
31		Asish Mukhopadhyay: Using simplicial partitions to determine a closest point to a query line. Pattern Recognition Letters 24(12): 1915-1920 (2003)
	2002
30		Asish Mukhopadhyay: Using simplicial partitions to determine a closest point to a query line. CCCG 2002: 10-12
29		Binay K. Bhattacharya, Asish Mukhopadhyay: On the Minimum Perimeter Triangle Enclosing a Convex Polygon. JCDCG 2002: 84-96
28		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
27		Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. WADS 2001: 438-449
26		S. V. Rao, Asish Mukhopadhyay: Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognition 34(11): 2163-2172 (2001)
	2000
25		S. V. Rao, Asish Mukhopadhyay: Efficient Algorithms for Computing the beta-spectrum. CCCG 2000
24		Asish Mukhopadhyay, S. V. Rao: Output-Sensitive Algorithm for Computing beta-Skeletons. Computing 65(3): 285-289 (2000)
23		G. Srinivasaraghavan, Asish Mukhopadhyay: Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geometry Appl. 10(1): 79-102 (2000)
	1999
22		Olivier Devillers, Asish Mukhopadhyay: Finding an ordinary conic and an ordinary hyperplane CoRR cs.CG/9909017: (1999)
21		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)
20		Olivier Devillers, Asish Mukhopadhyay: Finding an Ordinary Conic and an Ordinary Hyperplane. Nord. J. Comput. 6(4): 462-468 (1999)
	1997
19		S. V. Rao, Asish Mukhopadhyay: Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383
18		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
17		Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu: On the Ordinary Line Problem in Computational Geometry. Nord. J. Comput. 4(4): 330-341 (1997)
	1996
16		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
15		Binay K. Bhattacharya, Asish Mukhopadhyay: Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. ISAAC 1995: 22-31
14		Andrzej Lingas, Asish Mukhopadhyay: A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238
	1994
13		Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert: Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (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		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		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		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	[17]
2	Oswin Aichholzer	[18]
3	Vangalur S. Alagar (Vasu S. Alagar)	[2]
4	Md. Shafiul Alam	[51] [53] [54] [57]
5	Franz Aurenhammer	[18]
6	Binay K. Bhattacharya	[5] [6] [7] [10] [13] [15] [16] [21] [27] [28] [29] [46]
7	Prosenjit Bose	[49]
8	Samidh Chatterjee	[39]
9	Danny Z. Chen	[18]
10	Augustus Das	[40] [43]
11	Gautam Das	[28]
12	Gautam K. Das	[55]
13	Olivier Devillers	[20] [22]
14	Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III)	[41] [47]
15	Eugene Greene	[42] [44] [45] [46] [48] [58]
16	Ravi Mohan Hosabettu	[17]
17	Shreesh Jadhav	[6] [7] [8] [12] [13] [16]
18	Quanbin Jing	[35]
19	Pawel Kosicki	[38]
20	Chanchal Kumar	[10] [46]
21	Benjamin J. Lafreniere (Ben Lafreniere)	[39]
22	D. T. Lee (Der-Tsai Lee)	[18]
23	Andrzej Lingas	[14]
24	Anna Medvedeva	[36]
25	Pinaki Mitra	[34] [37]
26	Subhas C. Nandy	[55]
27	Giri Narasimhan	[27] [28]
28	Satish Panigrahi	[56]
29	Evanthia Papadopoulou	[18]
30	Sangameswar Patil	[55]
31	B. S. S. Pradhan	[4]
32	S. V. Rao	[19] [24] [25] [26] [32] [33] [37] [42] [48] [55]
33	J.-M. Robert	[13]
34	Jean-Marc Robert	[6]
35	Animesh Sarker	[51] [52]
36	G. Srinivasaraghavan	[9] [11] [23]
37	Tom Switzer	[52]
38	Godfried T. Toussaint	[5] [21]
39	Hamid Zarrabi-Zadeh	[50]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page