D. T. Lee

According to our database1, D. T. Lee
  • authored at least 242 papers between 1976 and 2016.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1997, "For contribution to Computational Geometry and Design and Analysis of Algorithms.".

IEEE Fellow

IEEE Fellow 1992, "For contributions to computational geometry and design and analysis of algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Broadcasting in weighted trees under the postal model.
Theor. Comput. Sci., 2016

The (1|1)R-Centroid Problem on the Plane.
CoRR, 2016

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
CoRR, 2016

Optimal time-convex hull for a straight-line highway in Lp-metrics.
Comput. Geom., 2016

The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

A feature fusion framework for hashing.
Proceedings of the 23rd International Conference on Pattern Recognition, 2016

A routability-driven flow routing algorithm for programmable microfluidic devices.
Proceedings of the 21st Asia and South Pacific Design Automation Conference, 2016

2015
Online dynamic power management with hard real-time guarantees.
Theor. Comput. Sci., 2015

The k-Nearest-Neighbor Voronoi Diagram Revisited.
Algorithmica, 2015

Capacitated Domination: Problem Complexity and Approximation Algorithms.
Algorithmica, 2015

2014
Algorithms and Computation (ISAAC 2012).
Theor. Comput. Sci., 2014

Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2014

Discovering joint audio-visual codewords for video event detection.
Mach. Vis. Appl., 2014

Preface Algorithms and Computation (ISAAC 2012).
Algorithmica, 2014

Online Dynamic Power Management with Hard Real-Time Guarantees.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Video Event Detection via Multi-modality Deep Learning.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips.
Proceedings of the 51st Annual Design Automation Conference 2014, 2014

Using geometric structures to improve the error correction algorithm of high-throughput sequencing data on MapReduce framework.
Proceedings of the 2014 IEEE International Conference on Big Data, 2014

Unsupervised Feature Learning for RGB-D Image Classification.
Proceedings of the Computer Vision - ACCV 2014, 2014

2013
The density maximization problem in graphs.
J. Comb. Optim., 2013

Guest Editors' Foreword.
Int. J. Comput. Geometry Appl., 2013

Optimal Time-Convex Hull under the Lp Metrics
CoRR, 2013

Online Power-Managing Strategy with Hard Real-Time Guarantees
CoRR, 2013

Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
CoRR, 2013

Power Domination in Circular-Arc Graphs.
Algorithmica, 2013

Optimal Time-Convex Hull under the L p Metrics.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Optimizing a MapReduce module of preprocessing high-throughput DNA sequencing data.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

CloudRS: An error correction algorithm of high-throughput sequencing data based on scalable framework.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

Voronoi Diagrams and Delaunay Triangulations.
World Scientific, ISBN: 978-981-4447-63-8, 2013

2012
Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2012

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geometry Appl., 2012

Higher Order City Voronoi Diagrams
CoRR, 2012

Higher Order City Voronoi Diagrams.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

DR. ION: Disaster rescue over information-oriented network.
Proceedings of the 2012 Fifth IEEE International Conference on Service-Oriented Computing and Applications (SOCA), 2012

Joint audio-visual bi-modal codewords for video event detection.
Proceedings of the International Conference on Multimedia Retrieval, 2012

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction.
Proceedings of the 49th Annual Design Automation Conference 2012, 2012

Robust visual domain adaptation with low-rank reconstruction.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices.
Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012

2011
Capacitated Domination: Constant Factor Approximation for Planar Graphs
CoRR, 2011

Capacitated Domination Problem.
Algorithmica, 2011

Finding Maximum Sum Segments in Sequences with Uncertainty.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Capacitated Domination: Constant Factor Approximations for Planar Graphs.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram.
Proceedings of the Algorithms - ESA 2011, 2011

The Density Maximization Problem in Graphs.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Connecting Two Trees with Optimal Routing Cost.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Multiple-Instance Learning: Multiple Feature Selection on Instance Representation.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Efficient algorithms for the sum selection problem and k maximum sums problem.
Theor. Comput. Sci., 2010

Scene Location Guide by Image-Based Retrieval.
Proceedings of the Advances in Multimedia Modeling, 2010

Boosting-based multiple kernel learning for image re-ranking.
Proceedings of the 18th International Conference on Multimedia 2010, 2010

Multi-party k-Means Clustering with Privacy Consideration.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Boosted Multiple Kernel Learning for Scene Category Recognition.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

Broadcasting in Heterogeneous Tree Networks.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing.
IEEE Trans. Vis. Comput. Graph., 2009

Editors' Foreword.
Int. J. Comput. Geometry Appl., 2009

GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events.
Bioinformatics, 2009

Fast Algorithms for the Density Finding Problem.
Algorithmica, 2009

Guest Editors' Forward.
Algorithmica, 2009

Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Optimal Randomized Algorithm for the Density Selection Problem.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008
Preface.
Theor. Comput. Sci., 2008

Reinforcement fuzzy-neural adaptive iterative learning control for nonlinear systems.
Proceedings of the 10th International Conference on Control, 2008

An output recurrent fuzzy neural network based iterative learning control for nonlinear systems.
Proceedings of the FUZZ-IEEE 2008, 2008

2007
State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms.
IEEE Trans. Vehicular Technology, 2007

Randomized algorithm for the sum selection problem.
Theor. Comput. Sci., 2007

A distributed multicast routing algorithm for real-time applications in wide area networks.
J. Parallel Distrib. Comput., 2007

Phylo-mLogo: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences.
BMC Bioinformatics, 2007

Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online).
BMC Bioinformatics, 2007

Time Convex Hull with a Highway.
Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal.
Proceedings of the IEEE International Conference on Information Reuse and Integration, 2007

Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching.
Proceedings of the 2007 International Conference on Information & Knowledge Engineering, 2007

Attack Probability Based Deterministic Key Predistribution Mechanism for Non-Uniform Sensor Deployment.
Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), 2007

Maximizing the Number of Independent Labels in the Plane.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006
Gridding spot centers of smoothly distorted microarray images.
IEEE Trans. Image Processing, 2006

An iterative distributed algorithm for multi-constraint multicast routing.
Computer Communications, 2006

SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools.
BMC Bioinformatics, 2006

Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem.
Proceedings of the Simulated Evolution and Learning, 6th International Conference, 2006

Design and applications of an algorithm benchmark system in a computational problem solving environment.
Proceedings of the 11th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2006

Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks".
IEEE/ACM Trans. Netw., 2005

Crosstalk- and performance-driven multilevel full-chip routing.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2005

Two Variations of the Minimum Steiner Problem.
J. Comb. Optim., 2005

Labeling Points on a Single Line.
Int. J. Comput. Geometry Appl., 2005

A testing framework for Web application security assessment.
Computer Networks, 2005

Randomized Algorithm for the Sum Selection Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Gridding the spot centers of microarray images.
Proceedings of the 13th European Signal Processing Conference, 2005

Efficient Exact Spare Allocation via Boolean Satisfiability.
Proceedings of the 20th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2005), 2005

SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

Power Domination Problem in Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Interval, Segment, Range, and Priority Search Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

Travel-time prediction with support vector regression.
IEEE Trans. Intelligent Transportation Systems, 2004

On the Crossing Distribution Problem in Two Regions.
J. Inf. Sci. Eng., 2004

The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach.
Int. J. Comput. Geometry Appl., 2004

A note from the editors-in-chief.
Int. J. Comput. Geometry Appl., 2004

Securing web application code by static analysis and runtime protection.
Proceedings of the 13th international conference on World Wide Web, 2004

Non-Detrimental Web Application Security Scanning.
Proceedings of the 15th International Symposium on Software Reliability Engineering (ISSRE 2004), 2004

An adaptive PID-type iterative learning controller unknown nonlinear systems.
Proceedings of the 8th International Conference on Control, 2004

Verifying Web Applications Using Bounded Model Checking.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

A new approach to the traveling salesman problem using genetic algorithms with priority encoding.
Proceedings of the IEEE Congress on Evolutionary Computation, 2004

2003
Knowledge Management for Computational Problem Solving.
J. UCS, 2003

Chief Editor's Notice.
Int. J. Comput. Geometry Appl., 2003

A Fast Crosstalk- and Performance-Driven Multilevel Routing System.
Proceedings of the 2003 International Conference on Computer-Aided Design, 2003

2002
A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks.
Proceedings of the International Symposium on Parallel Architectures, 2002

The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
Modeling automatic assembly and disassembly operations for virtual manufacturing.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2001

The Linfty-Voronoi Diagram of Segments and VLSI Applications.
Int. J. Comput. Geometry Appl., 2001

Towards Web-Based Computing.
Int. J. Comput. Geometry Appl., 2001

2000
Guest editorial: low-power electronics and design.
IEEE Trans. VLSI Syst., 2000

A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion.
Algorithmica, 2000

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems.
Algorithmica, 2000

A System for Analyzing Automatic Assembly and Disassembly Operations.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

A Web-Based Distributed Programming Environment.
Proceedings of the High-Performance Computing and Networking, 8th International Conference, 2000

1999
Critical area computation via Voronoi diagrams.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1999

Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl., 1999

Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization.
Algorithmica, 1999

A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

A Muscular-Like Compliance Control for Active Vehicle Suspension.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

A hierarchical workcell model for intelligent assembly and disassembly.
Proceedings of the Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation, 1999

1998
On crossing minimization problem.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1998

Solving the all-pair shortest path query problem on interval and circular-arc graphs.
Networks, 1998

Two-Guard Walkability of Simple Polygons.
Int. J. Comput. Geometry Appl., 1998

Geosheet: A Distributed Visualization Tool for Geometric Algorithms.
Int. J. Comput. Geometry Appl., 1998

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains.
Algorithmica, 1998

Critical area computation - a new approach.
Proceedings of the 1998 International Symposium on Physical Design, 1998

1997
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon.
IEEE Trans. Computers, 1997

Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model.
Int. J. Comput. Geometry Appl., 1997

k Best Cuts for Circular-Arc Graphs.
Algorithmica, 1997

A Faster One-Dimensional Topological Compaction Algorithm.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Voronoi Diagrams for Direction-Sensitive Distances.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Computational Geometry.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1996

Rectilinear Paths Among Rectilinear Obstacles.
Discrete Applied Mathematics, 1996

Computational Geometry.
ACM Comput. Surv., 1996

Geometric Algorithm Visualization, Current Status and Future.
Proceedings of the Applied Computational Geormetry, 1996

The Steiner Minimal Tree Problem in the lambda-Geormetry Plane.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

A study of neuromuscular-like control in rehabilitation robot.
Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

Steiner Problems on Directed Acyclic Graphs.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Rectilinear Path Problems among Rectilinear Obstacles Revisited.
SIAM J. Comput., 1995

Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon.
Inf. Process. Lett., 1995

An Optimal Algorithm for Roundness Determination on Convex Polygons.
Comput. Geom., 1995

Parallel Algorithms on Circular-arc Graphs.
Comput. Geom., 1995

Point Set Pattern Matching in d-Dimensions.
Algorithmica, 1995

An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.
Algorithmica, 1995

On Steiner Tree Problem with 45 Degree Routing.
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

Parallel algorithms for maximum matching in interval graphs.
Proceedings of IPPS '95, 1995

Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract).
Proceedings of the Algorithms, 1995

1994
On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model.
IEEE Trans. Computers, 1994

Restricted track assignment with applications.
Int. J. Comput. Geometry Appl., 1994

k-Best Cuts for Circular-Arc Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
The All-Pairs Quickest Path Problem.
Inf. Process. Lett., 1993

Maximum independent set of a permutation graph in K tracks.
Int. J. Comput. Geometry Appl., 1993

Minimal Link Visibility Paths Inside a Simple Polygon.
Comput. Geom., 1993

An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
An Optimal Algorithm for the Maximum Two-Chain Problem.
SIAM J. Discrete Math., 1992

Parallel enclosing rectangle on SIMD machines.
Parallel Computing, 1992

1-Segment Center Problems.
INFORMS Journal on Computing, 1992

On bends and lengths of rectilinear paths: a graph theoretic approach.
Int. J. Comput. Geometry Appl., 1992

Rstricted Track Assignment with Applications.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Rectilinear Paths among Rectilinear Obstacles.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
Topological Via Minimization Revisited.
IEEE Trans. Computers, 1991

Minimum Diameter Spanning Trees and Related Problems.
SIAM J. Comput., 1991

Out-of-Roundness Problem Revisited.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Shortest rectilinear paths among weighted obstacles.
Int. J. Comput. Geometry Appl., 1991

On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.
Proceedings of the Algorithms and Data Structures, 1991

Maximum Independent Set of a Permutation Graph in k Tracks.
Proceedings of the ISA '91 Algorithms, 1991

1990
NSF report - computer and computation research.
SIGACT News, 1990

NSF report - computer and computation research.
SIGACT News, 1990

Minimum Cuts for Circular-Arc Graphs.
SIAM J. Comput., 1990

Planar subset of multi-terminal nets.
Integration, 1990

Parallel Geometric Algorithms on a Mesh-Connected Computer.
Algorithmica, 1990

An Optimal Algorithm for the Maximum Two-Chain Problem.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System.
Proceedings of the SEKE'90, 1990

Shortest Rectilinear Paths among Weighted Obstacles.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
A new approach to topological via minimization.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1989

NSF report - computer and computation research.
SIGACT News, 1989

On-Line Bin Packing in Linear Time.
J. Algorithms, 1989

Parallel Batched Planar Point Location on the CCC.
Inf. Process. Lett., 1989

Rectilinear Shortest Paths in the presence of Rectangular Barriers.
Discrete & Computational Geometry, 1989

Application of mathematical constraint resolution to decision support system.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

Bounded-Diameter Minimum Spanning Trees and Related Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1987
An efficient new algorithm for 2-D line clipping: Its development and analysis.
Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, 1987

1986
Computational complexity of art gallery problems.
IEEE Trans. Information Theory, 1986

Computing the Largest Empty Rectangle.
SIAM J. Comput., 1986

Generalized Dalaunay Triangualtion for Planar Graphs.
Discrete & Computational Geometry, 1986

Computing the visibility polygon from an edge.
Computer Vision, Graphics, and Image Processing, 1986

On a circle placement problem.
Computing, 1986

Complexity of Some Laction Problems.
Algorithmica, 1986

Generating Binary Trees of Bounded Height.
Acta Inf., 1986

Geometric Location Problems and Their Complexity.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
A Simple On-Line Bin-Packing Algorithm
J. ACM, July, 1985

Relative neighborhood graphs in the Li-metric.
Pattern Recognition, 1985

Finding the diameter of a set of lines.
Pattern Recognition, 1985

The Power of Geometric Duality Revisited.
Inf. Process. Lett., 1985

The Power of Geometric Duality.
BIT, 1985

Rectilinear shortest paths with rectangular barriers.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Computational Geometry - A Survey.
IEEE Trans. Computers, 1984

On the 2-Dimensional Channel Assignment Problem.
IEEE Trans. Computers, 1984

Euclidean shortest paths in the presence of rectilinear barriers.
Networks, 1984

On a Circle-Cover Minimization Problem.
Inf. Process. Lett., 1984

An optimal time and minimal space algorithm for rectangle intersection problems.
International Journal of Parallel Programming, 1984

On the maximum empty rectangle problem.
Discrete Applied Mathematics, 1984

Graph Algorithms on a Tree-Structured Parallel Computer.
BIT, 1984

Computing the Largest Empty Rectangle.
Proceedings of the STACS 84, 1984

1983
Dynamic Voronoi diagrams.
IEEE Trans. Information Theory, 1983

(g 0, g 1, ... g k)-Trees and Unary OL Systems.
Theor. Comput. Sci., 1983

Ranking and Unranking of B-Trees.
J. Algorithms, 1983

On finding the convex hull of a simple polygon.
International Journal of Parallel Programming, 1983

Visibility of a simple polygon.
Computer Vision, Graphics, and Image Processing, 1983

On the X-Y Convex Hull of a Set of X-Y Polygons.
BIT, 1983

The Power of Geometric Duality
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
An Optimal Illumination Region Algorithm for Convex Polygons.
IEEE Trans. Computers, 1982

On k-Nearest Neighbor Voronoi Diagrams in the Plane.
IEEE Trans. Computers, 1982

Ranking and Unranking of 2-3 Trees.
SIAM J. Comput., 1982

Medial Axis Transformation of a Planar Shape.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

Efficient algorithms for interval graphs and circular-arc graphs.
Networks, 1982

An Improved Algorithm for the Rectangle Enclosure Problem.
J. Algorithms, 1982

1981
Record Allocation for Minimizing Seek Delay.
Theor. Comput. Sci., 1981

An On-Chip Compare/Steer Bubble Sorter.
IEEE Trans. Computers, 1981

Generalization of Voronoi Diagrams in the Plane.
SIAM J. Comput., 1981

An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric.
Networks, 1981

Finding Intersection of Rectangles by Range Search.
J. Algorithms, 1981

Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Shading of regions on vector display devises.
Proceedings of the 8th Annual Conference on Computer Graphics and Interactive Techniques, 1981

1980
Quintary Trees: A File Structure for Multidimensional Database Systems.
ACM Trans. Database Syst., 1980

Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications.
SIAM J. Comput., 1980

Two-Dimensional Voronoi Diagrams in the Lp-Metric.
J. ACM, 1980

Two algorithms for constructing a Delaunay triangulation.
International Journal of Parallel Programming, 1980

1979
An Optimal Solution for the Channel-Assignment Problem.
IEEE Trans. Computers, 1979

An Optimal Algorithm for Finding the Kernel of a Polygon.
J. ACM, 1979

A Note on the all Nearest-Neighbor Problem for Convex Polygons.
Inf. Process. Lett., 1979

Location of Multiple Points in a Planar Subdivision.
Inf. Process. Lett., 1979

1978
The All Nearest-Neighbor Problem for Convex Polygons.
Inf. Process. Lett., 1978

1977
Location of a Point in a Planar Subdivision and Its Applications.
SIAM J. Comput., 1977

Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees.
Acta Inf., 1977

1976
An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function.
IEEE Trans. Computers, 1976

Location of a Point in a Planar Subdivision and its Applications
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976


  Loading...