#### Filter Results:

#### Publication Year

2005

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper presents the summary of all the results of the participants in the event SHREC08 – CAD Model Track. 1 INTRODUCTION Engineering parts typically have high genus, rounding features (fillets, chamfers), and presence of an internal structure. They are closed watertight volumes. Engineering models can be parts or assemblies. A part is an atomic unit… (More)

We present an algorithm for generating the Voronoi cells for a set of rational C<sup>1</sup>-continuous planar closed curves, which is precise up to machine precision. Initially, bisectors for pairs of curves, (<i>C(t), C<sup>i</sup>(r))</i>, are generated symbolically and represented as implicit forms in the <i>tr</i>-parameter space. Then, the bisectors… (More)

- Subramani Sellamani, Ramanathan Muthuganapathy, Yagnanarayanan Kalyanaraman, Sundar Murugappan, Manish Goyal, Karthik Ramani +1 other
- 2010

Analysis of mesh models is gaining prominence as it has wide range of applications from engineering to medicine. In this paper, we present a method for analyzing meshes through the abstraction of its prominent cross-sections (PCS). An algorithm that can robustly yield prominent cross-section at any point on the mesh that approximates the local sweep has… (More)

Content based image retrieval (CBIR), a technique which uses visual contents to search images from the large scale image databases, is an active area of research for the past decade. It is increasingly evident that an image retrieval system has to be domain specific. In this paper, we present an algorithm for retrieving images with respect to a database… (More)

The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on the average is linear in the number of points. In this paper, we generalize this approach to compute the minimum enclosing sphere of free-form hypersurfaces, in arbitrary dimensions.… (More)

We present an algorithm for generating Voronoi cells for a set of planar piecewise C 1-continuous closed rational curves, which is precise up to machine precision. The algorithm starts with the symbolically generated bisectors for pairs of C 1-continuous curve segments (C(t),C i (r)). The bisectors are represented implicitly in the tr-parameter space. Then,… (More)

- Suthirth Vaidya, Abhijith Chunduru, Ramanathan Muthuganapathy, Ganapathy Krishnamurthi
- 2015

We present our entry for the Longitudinal Multiple Sclerosis Challenge 2015 using 3D convolutional neural networks (CNN). We model a voxel-wise classifier using multi-channel 3D patches of MRI volumes as input. For each ground truth, a CNN is trained and the final segmentation is obtained by combining the probability outputs of these CNNs. Efficient… (More)

While random polygon generation from a set of planar points has been widely investigated in the literature, very few works address the construction of a simple polygon with minimum area (MINAP) or maximum area (MAXAP) from a set of fixed planar points. Currently, no deterministic algorithms are available to compute MINAP/MAXAP, as the problems have been… (More)