Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

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 | |

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) | |

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 | |

37 | Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao: Computing the Closest Point to a Circle. CCCG 2003: 132-135 | |

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) | |

26 | S. V. Rao, Asish Mukhopadhyay: Fast algorithms for computing Beta-skeletons and their relatives. Pattern Recognition 34(11): 2163-2172 (2001) | |

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) | |

19 | S. V. Rao, Asish Mukhopadhyay: Fast Algorithms for Computing beta-Skeletons and Their Relatives. ISAAC 1997: 374-383 |

Selection of 10 from 58 records - Asish Mukhopadhyay has 39 coauthors

Last update 2012-09-10 CET by the DBLP Team — Content released under the ODC-BY 1.0 license — See also our legal information page