# Ravi Janardan

According to our database

Collaborative distances:

^{1}, Ravi Janardan authored at least 107 papers between 1982 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Searching for the closest-pair in a query translate.

CoRR, 2018

New Bounds for Range Closest-Pair Problems.

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

On the arrangement of stochastic lines in ℤ

^{2}.
J. Discrete Algorithms, 2017

New bounds for range closest-pair problems.

CoRR, 2017

On the expected diameter, width, and complexity of a stochastic convex-hull.

CoRR, 2017

On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull.

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

The Most-Likely Skyline Problem for Stochastic Points.

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

On the Separability of Stochastic Geometric Objects, with Applications.

CoRR, 2016

On the Separability of Stochastic Geometric Objects, with Applications.

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Range search on tuples of points.

J. Discrete Algorithms, 2015

2014

A General Technique for Top-$k$ Geometric Intersection Query Problems.

IEEE Trans. Knowl. Data Eng., 2014

Data structures for range-aggregate extent queries.

Comput. Geom., 2014

2013

CG_Hadoop: computational geometry in MapReduce.

Proceedings of the 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2013

2012

Building a Communication Bridge With Mobile Hubs.

IEEE Trans. Automation Science and Engineering, 2012

Algorithms for range-skyline queries.

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2011

Efficient Top-

*k*Queries for Orthogonal Ranges.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010

Multiple structure alignment and consensus identification for proteins.

BMC Bioinformatics, 2010

2009

Biological Image Analysis via Matrix Approximation.

Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

Efficient Non-Intersection Queries on Aggregated Geometric Data.

Int. J. Comput. Geometry Appl., 2009

Building a Communication Bridge with Mobile Hubs.

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008

Developmental stage annotation of Drosophila gene expression pattern images via an entire solution path for LDA.

TKDD, 2008

Heterogeneous data fusion for alzheimer's disease study.

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Efficient algorithms for reverse proximity query problems.

Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Data Structures for Range-Aggregate Extent Queries.

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2006

Feature Reduction via Generalized Uncorrelated Linear Discriminant Analysis.

IEEE Trans. Knowl. Data Eng., 2006

Heuristics for estimating contact area of supports in layered manufacturing.

ACM Journal of Experimental Algorithmics, 2006

Multiple Structure Alignment and Consensus Identification for Proteins.

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

CPM: A Covariance-preserving Projection Method.

Proceedings of the Sixth SIAM International Conference on Data Mining, 2006

Efficient model selection for regularized linear discriminant analysis.

Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005

IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition.

IEEE Trans. Knowl. Data Eng., 2005

A vision-based approach to collision prediction at traffic intersections.

IEEE Trans. Intelligent Transportation Systems, 2005

A collision prediction system for traffic intersections.

Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Efficient Non-intersection Queries on Aggregated Geometric Data.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Computational Geometry.

Proceedings of the Handbook of Data Structures and Applications., 2004

Manufacturing processes.

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data.

IEEE/ACM Trans. Comput. Biology Bioinform., 2004

An Optimization Criterion for Generalized Discriminant Analysis on Undersampled Problems.

IEEE Trans. Pattern Anal. Mach. Intell., 2004

Approximate Multiple Protein Structure Alignment Using the Sum-of-Pairs Distance.

Journal of Computational Biology, 2004

Pairwise Protein Structure Alignment Based on an Orientation-independent Backbone Representation.

J. Bioinformatics and Computational Biology, 2004

Two-Dimensional Linear Discriminant Analysis.

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Efficient Kernel Discriminant Analysis via QR Decomposition.

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

IDR/QR: an incremental dimension reduction algorithm via QR decomposition.

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

GPCA: an efficient dimension reduction scheme for image compression and retrieval.

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

Feature extraction via generalized uncorrelated linear discriminant analysis.

Proceedings of the Machine Learning, 2004

Approximating contact-area of supports in layered manufacturing.

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Protecting critical facets in layered manufacturing: implementation and experimental results.

Computer-Aided Design, 2003

Minimizing the total projection of a set of vectors, with applications to layered manufacturing.

Computer-Aided Design, 2003

Pairwise Protein Structure Alignment Based on an Orientation-Independent Representation of the Backbone Geometry.

Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

A new optimization criterion for generalized discriminant analysis on undersampled problems.

Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003

Geometric Algorithms for Layered Manufacturing.

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2002

Computing an Optimal Hatching Direction in Layered Manufacturing.

Int. J. Comput. Math., 2002

A decomposition-based approach to layered manufacturing.

Comput. Geom., 2002

Terrain Polygon Decomposition, with Application to Layered Manufacturing.

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

A Decomposition-Based Approach to Layered Manufacturing.

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Computing Optimal Hatching Directions in Layered Manufacturing.

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Protecting critical facets in layered manufacturing.

Comput. Geom., 2000

1999

Computing the Width of a Three-Dimensional Point Set: An Experimental Study.

ACM Journal of Experimental Algorithmics, 1999

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.

Inf. Process. Lett., 1999

On the width and roundness of a set of points in the plane.

Int. J. Comput. Geometry Appl., 1999

Minimizing support structures and trapped area in two-dimensional layered manufacturing.

Comput. Geom., 1999

On some geometric optimization problems in layered manufacturing.

Comput. Geom., 1999

Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design.

Comput. Geom., 1999

Protecting Facets in Layered Manufacturing.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

Special Issue: Computational Geometry and Computer-Aided Design and Manufacturing.

Computer-Aided Design, 1998

Computing the Width of a Three-Dimensional Point Set: An Experimental Study.

Proceedings of the Algorithm Engineering, 1998

Multi-Criteria Geometric Optimization Problems in Layered Manufacturing.

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

A Technique for Adding Range Restrictions to Generalized Searching Problems.

Inf. Process. Lett., 1997

The Rectangle Enclosure and Point-Dominance Problems Revisited.

Int. J. Comput. Geometry Appl., 1997

Computing planar swept polygons under translation.

Computer-Aided Design, 1997

On Some Geometric Optimization Problems in Layered Manufacturing.

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

1996

Efficient net extraction for restricted orientation designs [VLSI layout].

IEEE Trans. on CAD of Integrated Circuits and Systems, 1996

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.

Comput. Geom., 1996

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.

Comput. Geom., 1996

Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining.

Computer-Aided Design, 1996

Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design.

Proceedings of the Applied Computational Geormetry, 1996

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons.

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.

J. Algorithms, 1995

Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems.

Comput. Geom., 1995

Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining.

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

The Rectangle Enclosure and Point-Dominance Problems Revisited.

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Widest-Corridor Problems.

Nord. J. Comput., 1994

On Intersection Searching Problems Involving Curved Objects.

Proceedings of the Algorithm Theory, 1994

Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects.

Proceedings of the Algorithms, 1994

Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects.

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Generalized intersection searching problems.

Int. J. Comput. Geometry Appl., 1993

On maintaining the width and diameter of a planar point-set online.

Int. J. Comput. Geometry Appl., 1993

Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

A fast algorithm for VLSI net extraction.

Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993

Widest-corridor Problems.

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

New Results on Dynamic Planar Point Location.

SIAM J. Comput., 1992

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.

Mathematical Systems Theory, 1992

Algorithms for Ray-Shooting and Intersection Searching.

J. Algorithms, 1992

1991

Efficient Maintenance of the Union of Intervals on a Line, with Applications.

J. Algorithms, 1991

On the Dynamic Maintenance of Maximal Points in the Plane.

Inf. Process. Lett., 1991

Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications.

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

On Maintaining the Width and Diameter of a Planar Point-Set Online.

Proceedings of the ISA '91 Algorithms, 1991

1990

Space-Efficient Message Routing in c-Decomposable Networks.

SIAM J. Comput., 1990

Efficient Dynamic Algorithms for Some Geometric Intersection Problems.

Inf. Process. Lett., 1990

Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Efficient Maintenance of the Union Intervals on a Line, with Applications.

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

New Results on Dynamic Planar Point Location

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Efficient Message Routing in Planar Networks.

SIAM J. Comput., 1989

1988

Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks.

IEEE Trans. Computers, 1988

Designing Networks with Compact Routing Tables.

Algorithmica, 1988

1986

Optimal Message Routing without Complete Routing Tables (preliminary version).

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Separator-Based Strategies for Efficient Message Routing (Preliminary Version)

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1982

A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem.

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982