Demo Data from EDBT 2026 / reviewers in the wild / expert
Jayanth Majhi
dblp:73/1771
· DBLP profile ↗
11ranked-venue papers
5as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 6 · 3 first-authorTheory of computation · 5 · 2 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
1 paper |
Computational fabrication · 62% Geometric modeling and processing · 38% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
geometric optimization |
0.0 | 1 | 1998 | Multi-Criteria Geometric Optimization Problems in Layered Manufacturing · SCG 1998 |
Geometric modeling and processing › computational geometry
geometric algorithms |
0.0 | 1 | 1996 | Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining · Comput. Aided Des. 1996 |
Computational fabrication › process planning
part orientation |
0.0 | 1 | 1996 | Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining · Comput. Aided Des. 1996 |
Computational fabrication › machining
5-axis machining |
0.0 | 1 | 1996 | Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining · Comput. Aided Des. 1996 |
Computational fabrication › machining
CNC machining |
0.0 | 1 | 1996 | Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining · Comput. Aided Des. 1996 |
Methods — techniques the papers use, named apart from their topics
voronoi diagram · 0.0point location · 0.0convex hull · 0.0arrangement · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | A decomposition-based approach to layered manufacturing
Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram |
Comput. Geom. | 3 |
| 2001 | A Decomposition-Based Approach to Layered Manufacturing
Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram |
WADS | 3 |
| 2000 | Protecting critical facets in layered manufacturing
Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson 0001, Jayanth Majhi |
Comput. Geom. | 5 |
| 1999 | Protecting Facets in Layered Manufacturing
Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson 0001, Jayanth Majhi |
FSTTCS | 5 |
| 1999 | Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
Jayanth Majhi, Prosenjit Gupta, Ravi Janardan |
Comput. Geom. | 1 |
| 1999 | On some geometric optimization problems in layered manufacturing
Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta |
Comput. Geom. | 1 |
| 1999 | Minimizing support structures and trapped area in two-dimensional layered manufacturing
Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta |
Comput. Geom. | 1 |
| 1998 | Multi-Criteria Geometric Optimization Problems in Layered ManufacturingabstractIn Layered Manufacturing, the choice of the build direction for the model inuences several design criteria, including the number of layers, the volume and contact-area of the support structures, and the surface nish. These, in turn, impact the throughput and cost of the process. In this paper, ecient geometric algorithms are given to reconcile two or more of these criteria simultaneously, under three formulations of multi-criteria optimization: Finding a build direction which (i) optimizes the criteria sequentially, (ii) optimizes their weighted sum, or (iii) allows the criteria to meet designer-prescribed thresholds. The algorithms that involve \\support volume" or \\contact area" apply only to convex models, while the algorithms that involve \\surface nish" and \\number of layers" apply to any polyhedral model. Some of the latter algorithms have also been implemented and tested on real-world models obtained from industry. The geometric techniques used in the paper include construction and searching of certain arrangements on the unit-sphere, three-dimensional convex hulls, Voronoi diagrams, point location, and hierarchical representations. Additionally, solutions are also provided, for the constrained versions of two geometric problems, namely polyhedron width and largest empty disk on the unit-sphere. 1 Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt |
SCG | 1 |
| 1997 | On Some Geometric Optimization Problems in Layered Manufacturing
Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta |
WADS | 1 |
| 1996 | Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining
Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo |
Comput. Aided Des. | 3 |
| 1995 | Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining
Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo |
WADS | 3 |