A5075903718- Computational Geometry and Mesh Generation
- Optimization and Packing Problems
- Data Management and Algorithms
- Algorithms and Data Compression
- Artificial Intelligence in Games
- 3D Shape Modeling and Analysis
- Robotic Path Planning Algorithms
- Digital Image Processing Techniques
- Advanced Numerical Analysis Techniques
- Cellular Automata and Applications
- Digital Games and Media
- Advanced Graph Theory Research
- Rough Sets and Fuzzy Logic
- Geographic Information Systems Studies
- Data Visualization and Analytics
- Graph Theory and Algorithms
- Biometric Identification and Security
- Hand Gesture Recognition Systems
- Genome Rearrangement Algorithms
- Photovoltaic System Optimization Techniques
- Fixed Point Theorems Analysis
- Assembly Line Balancing Optimization
- Advanced Materials and Mechanics
- Machine Learning and Algorithms
- Silicon and Solar Cell Technologies
Indian Institute of Technology Bombay
2017
Oregon State University
2003-2011
Stony Brook University
2000-2005
Infosys (India)
2005
University of Georgia
2003
Cornell University
2003
Universidad de Valladolid
2003
State University of New York
2000-2001
Indian Institute of Science Bangalore
1998
We give the first algorithmic study of a class "covering tour" problems related to geometric traveling salesman problem: Find polygonal tour for cutter so that it sweeps out specified region ("pocket") in order minimize cost depends mainly on number turns. These arise naturally manufacturing applications computational geometry automatic tool path generation and inspection systems, as well arc routing ("postman") with turn penalties. prove NP-completeness minimum-turn milling efficient...
We give the first algorithmic study of a class “covering tour” problems related to geometric Traveling Salesman Problem: Find polygonal tour for cutter so that it sweeps out specified region (“pocket”), in order minimize cost depends not only on length but also number turns. These arise naturally manufacturing applications computational geometry automatic tool path generation and inspection systems, as well arc routing (“postman”) with turn penalties. prove lower bounds (NP-completeness...
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study 3-dimensional version problem enclose point with cone fixed apex angle α.
In an attempt to regionalize and visualize regions of information space, we offer a method for regionalization based on predetermined area relationships. This problem can be conceptualized as inverse multiplicatively weighted Voronoi diagram. To compute such diagram, adaptive algorithm. Initial testing indicates good results quick convergence.
In this paper we study the problems of separability two disjoint point sets in 3D by multiple criteria extending some notions on plane.
Abstract Efficiently maintaining the partition induced by a set of features is an important problem in building decision‐tree classifiers. In order to identify small discriminating features, we need capability efficiently adding and removing specific determining effect these changes on classification or partition. this paper introduce variety randomized deterministic data structures support operations both general geometrically partitions. We give Monte Carlo Las Vegas that realize...
A photovoltaic (PV) module is subjected to numerous cycles of mechanical and thermal loads during its lifetime. These can induce normal shear stresses in different layers the module. Normal may lead crack development propagation silicon resulting power loss. Excessive culminate delamination layers. Choosing appropriate materials, module-layout design layers' dimensions help mitigating that premature failure. However, it both expensive time consuming evaluate most optimum conditions for...
We give the first algorithmic study of a class ``covering tour'' problems related to geometric Traveling Salesman Problem: Find polygonal tour for cutter so that it sweeps out specified region (``pocket''), in order minimize cost depends mainly on number em turns. These arise naturally manufacturing applications computational geometry automatic tool path generation and inspection systems, as well arc routing (``postman'') with turn penalties. prove NP-completeness minimum-turn milling...