Demo Data from EDBT 2026 / reviewers in the wild / expert
Suraj Musuvathy
dblp:46/7438
· DBLP profile ↗
7ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 7 · 4 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
4 papers |
Geometric modeling and processing · 97% Image and video processing · 3% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › solid modeling
lattice structures |
0.4 | 1 | 2019 | Programmed-Lattice Editor and accelerated processing of parametric program-representations of steady lattices · Comput. Aided Des. 2019 |
Geometric modeling and processing › shape modeling › parametric modeling › spline surfaces
b-spline surface |
0.1 | 1 | 2011 | Computing medial axes of generic 3D regions bounded by B-spline surfaces · Comput. Aided Des. 2011 |
Geometric modeling and processing › skeletonization
medial axis transform |
0.1 | 1 | 2011 | Computing medial axes of generic 3D regions bounded by B-spline surfaces · Comput. Aided Des. 2011 |
Geometric modeling and processing › shape analysis › curvature analysis
surface curvature analysis |
0.1 | 1 | 2011 | Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces · Comput. Aided Des. 2011 |
Geometric modeling and processing
computer-aided design |
0.1 | 1 | 2019 | Programmed-Lattice Editor and accelerated processing of parametric program-representations of steady lattices · Comput. Aided Des. 2019 |
Image and video processing › saliency detection
salient object detection |
0.0 | 1 | 2011 | Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces · Comput. Aided Des. 2011 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Programmed-Lattice Editor and accelerated processing of parametric program-representations of steady lattices
Ashish Gupta 0014, Kelsey Kurzeja, Jarek Rossignac, George Allen, Pranav Srinivas Kumar, Suraj Musuvathy |
Comput. Aided Des. | 6 |
| 2016 | Average curve of n smooth planar curves
Mukul Sati, Jarek Rossignac, Raimund Seidel, Brian Wyvill, Suraj Musuvathy |
Comput. Aided Des. | 5 |
| 2012 | Generalized Swept Mid-structure for Polygonal ModelsabstractAbstract We introduce a novel mid‐structure called the generalized swept mid‐structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet‐by‐sheet topology, versus triangle‐by‐triangle topology produced by other mid‐structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclosed by the surface, is used to decompose the volume into a set of slices. A technique for computing the 1D mid‐structures of these slices is introduced. The mid‐structures of adjacent slices are then iteratively matched through a boundary similarity computation and triangulated to form the GSM. This structure respects the topology of the input surface model is a hybrid mid‐structure representation. The construction and topology of the GSM allows for local and global simplification, used in further applications such as parameterization, volumetric mesh generation and medical applications. Guoning Chen, Suraj Musuvathy, Elaine Cohen, Charles D. Hansen |
Comput. Graph. Forum | 3 |
| 2011 | Computing medial axes of generic 3D regions bounded by B-spline surfaces
Suraj Musuvathy, Elaine Cohen, James N. Damon |
Comput. Aided Des. | 1 |
| 2011 | Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joon-Kyung Seong |
Comput. Aided Des. | 1 |
| 2010 | Ridge Extraction from Isosurfaces of Volumetric Data Using Implicit B-SplinesabstractRidges are extremal curves of principal curvatures on a surface that indicate salient intrinsic features of its shape. This paper presents a novel approach for extracting ridges of improved quality from isosurfaces of volumetric scalar-valued grids by converting them to implicit trivariate B-spline representations. A robust tracing approach demonstrated to extract ridges accurately from parametric B-spline surfaces is extended to extract ridges directly from the implicit representations resulting in accurate and hence smoother, connected ridge curves as compared to approaches that extract ridges directly from discrete representations. This approach can also be used to extract ridges directly from smooth representations such as isosurfaces of volumetric B-Spline CAD models and algebraic functions, and extended to extract ridges from polygonal meshes, as demonstrated in the paper. Most of the existing approaches for ridge extraction address only crests, a certain subset of the ridges on a surface. The approach presented in this paper enables extraction of all types of generic ridges on a surface thereby presenting a complete solution. Suraj Musuvathy, Elaine Cohen |
Shape Modeling International | 1 |
| 2009 | Tracing ridges on B-Spline surfacesabstractRidges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualization and various other applications. Ridges are loci of points on a surface where either of the principal curvatures attain a critical value in its respective principal direction. These curves have complex behavior near umbilics on a surface, and may also pass through certain turning points causing added complexity for ridge computation. We present a new algorithm for numerically tracing ridges on B-Spline surfaces that also accurately captures ridge behavior at umbilics and ridge turning points. The algorithm traverses ridge segments by detecting ridge points while advancing and sliding in principal directions on a surface in a novel manner, thereby computing connected curves of ridge points. The output of the algorithm is a set of curve segments, some or all of which, may be selected for other applications such as those mentioned above. The results of our technique are validated by comparison with results from previous research and with a brute-force domain sampling technique. Suraj Musuvathy, Elaine Cohen, Joon-Kyung Seong, James N. Damon |
Symposium on Solid and Physical Modeling | 1 |