Jian Mu, Xiaomin Liu, Malgorzata M. Kamocka, Zhiliang Xu, Mark S. Alber, Elliot D. Rosen, ...
We study the problem of segmenting, reconstructing, and analyzing the structure growth of thrombi (clots) in blood vessels in vivo based on 2-photon microscopic image data. First, we develop an...
Roberto Tamassia, Pankaj K. Agarwal, Nancy Amato, Danny Z. Chen, David Dobkin
Patrick R. Morin 1 Outline of Proposed Research Activities The proposed research will be in the area of applied algorithms in both the sequential and parallel domains. The focus of this work will be...
Traversing the Machining Graph (2008)
Danny Z. Chen, Rudolf Fleischer, Haitao Wang, Hong Zhu
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag machining path for a...
Approximating the Maximum Sharing Problem (2008)
Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo S. Hu, Jian Li, Michael T. Niemier, ...
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the graph, with the...
Traversing the Machining Graph (2008)
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag machining path for a...
Robert J. Szczerba, Danny Z. Chen, Robert J. Szczerba
In this paper we study the problem of determining optimal paths in a dynamic, 2-D environment. We present anovel cell decomposition approach which generates optimal paths based on a number of di...
An FPGA Solution for Radiation Dose Calculation (2008)
Kevin Whitton, X. Sharon, Hu Cedric, X. Yu, Danny Z. Chen
Abstract — Radiation dose calculation is an important step in the treatment of cancer patients requiring radiation therapy. It ensures that the physician prescribed dose agrees with the dose...
Optimal Guarding of Polygons and Monotone Chains (Extended Abstract) (2008)
Danny Z. Chen, Vladimir Estivill-Castro, Jorge Urrutia
) Danny Z. Chen Vladimir Estivill-Castro y Jorge Urrutia z Abstract In this paper we study several problems concerning the guarding of a polygon or a x- monotone polygonal chain P with n vertices...
Yingping Huang, Jinhui Xu, Danny Z. Chen
We prove the maximum number of geometric permutations, induced by line transversals to a set of n pairwise disjoint congruent spheres in R d with d 3, is no more than 4 when n is sufficiently large,...
Parallel Content-Based Image Analysis on PIM Processors (2007)
Ovidiu Daescu, Peter M. Kogge, Danny Z. Chen
In this paper we study the problem of retrieving images from a large digital library, by searching the image contents with a specified pattern, using a low cost processing-in-memory (PIM) parallel...
In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnection model. The previously best...
EFFICIENT APPROXIMATION ALGORITHMS FOR FLOORPLAN AREA MINIMIZATION (2007)
Approximation has been shown to be an e�ective method for reducing the time and space costs of solving various �oorplan area minimization problems. In this paper � we present several...
Roberto Tamassia, Pankaj K. Agarwal, Nancy Amato, Danny Z. Chen, David Dobkin, ...
The proposed research will be in the area of applied algorithms in both the sequential and parallel domains. The focus of this work will be on the design and testing of realistic algorithms for...
Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
We present efficient algorithms for solving polygonal-path approximation problems in three and higher dimensions. Given an n-vertex polygonal curve P in IR
Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
In this paper, we study several geometric path query problems. Given a scene of disjoint polygonal obstacles with totally n vertices in the plane, we construct ecient data structures that enable fast...
Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...
Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
The problem of optimizing the sum of m linear fractional functions (SOLF) in a xed dimension d, subject to n linear constraints, arises in a number of theoretical and applied areas. This paper...
Chengbang Huang, Simon P. Kanaan, Stefan Wuchty, Danny Z. Chen, Jesús A. Izaguirre
The goal of contemporary proteome research is the elucidation of protein interactions in the cell. Based on cur-rently available protein-protein interaction and domain data of S. cerevisiae, we...
Predicting protein-protein interactions from protein domains using a set cover approach (2007)
Chengbang Huang, Faruck Morcos, Simon P. Kanaan, Stefan Wuchty, Danny Z. Chen, Jesús A. Izaguirre
Abstract—One goal of contemporary proteome research is the elucidation of cellular protein interactions. Based on currently available protein-protein interaction and domain data, we introduce a...
Predicting protein-protein interactions from protein domains using a set cover approach (2007)
Chengbang Huang, Faruck Morcos, Simon P. Kanaan, Stefan Wuchty, Danny Z. Chen, Jesús A. Izaguirre
Abstract—One goal of contemporary proteome research is the elucidation of cellular protein interactions. Based on currently available protein-protein interaction and domain data, we introduce a...
On approximating the maximum simple sharing problem (2006)
Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu
Abstract. In the maximum simple sharing problem (MSS), we want to compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the...
On approximating the maximum simple sharing problem (2006)
Danny Z. Chen, Rudolf Fleischer, Zhiyi Xie, Hong Zhu
Abstract. In the maximum simple sharing problem (MSS), wewantto compute a set of node-disjoint simple paths in an undirected bipartite graph covering as many nodes as possible of one layer of the...
Sequences Characterizing k-Trees (2006)
Lotker, Zvi, Majumdar, Debapriyo, Narayanaswamy, N.S., Weber, Ingmar, Chen, Danny Z., Lee, D. T.
A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) on n vertices if and only if there are least two 1’s in the sequence, and the sum of the elements...
Eliminating wire crossings for molecular quantum-dot cellular automata implementation (2005)
Amitabh Chaudhary, Danny Z. Chen, Xiaobo Sharon Hu, Kevin Whitton
Abstract — When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses on...
Optimizing the sum of linear fractional functions and applications (2000)
Chen, Danny Z., Daescu, Ovidiu, Dai, Yang, Katoh, Naoki, Wu, Xiadong, Xu, Jinhui
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 9-11, 2000 -- T.p. verso ; This symposium was sponsored by the ACM Special Interest...
Efficient Global Register Allocation for Minimizing Energy Consumption (1999)
Yumin Zhang, Xiaobo (Sharon) Hu, Danny Z. Chen
Data referencing during program execution can be a signicant source of energy consumption especially for data-intensive programs. In this paper, we propose an approach to minimize such energy...
Low Energy Register Allocation Beyond Basic Blocks (1999)
Yumin Zhang, Xiaobo (Sharon) Hu, Danny Z. Chen
An approach of doing register allocation beyond basic blocks for low energy is presented in this paper. With careful analysis of boundary conditions between consecutive blocks, our approach achieves...
Finding an optimal path without growing the tree (1998)
Danny Z. Chen, Ovidiu Daescu, Xiaobo (sharon Hu, Jinhui Xu C
For problems on computing an optimal path as well as its length in a certain setting, the “standard” approach for finding an actual optimal path is by building (or “growing”) a single-source...
Space-efficient algorithms for approximating polygonal curves in two-dimensional space (1998)
Given an n-vertex polygonal curve P = [p 1, p 2, : ::, pn] in the 2-dimensional space R 2, we consider the problem of approximating P by finding another polygonal curve P 0
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions (1998)
Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
We present efficient algorithms for solving polygonal-path approximation problems in three and higher dimensions. Given an n-vertex polygonal curve P in IR d , d 3, we approximate P by another...
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions (1998)
Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink
We present efficient algorithms for solving polygonal -path approximation problems in three and higher dimensions. Given an n-vertex polygonal curve P in IR d , d 3, we approximate P by another...
Finding an Optimal Path without Growing the Tree (1998)
Danny Z. Chen, Ovidiu Daescu, Xiaobo (Sharon) Hu, Jinhui Xu
. In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal paths for these...
Solving the All-Pair Shortest Path Query Problem on Interval and Circular-Arc Graphs (1998)
Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan
In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the...
Efficient Parallel Algorithms for Planar st-Graphs (1997)
Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
Planar st-graphs find applications in a number of areas. In this paper, we present efficient parallel algorithms for solving several fundamental problems on planar st-graphs. The problems we consider...
Maintaining visibility of a polygon with a moving point of view (1996)
The following problem is studied in this paper: Given a scene with an n-vertex simple polygon and a trajectory path in the plane, construct a data structure for reporting the perspective view from a...
Strategic Directions in Computational Geometry (1996)
Roberto Tamassia, Roberto Tamassia (editor, Pankaj K. Agarwal, Nancy Amato, Danny Z. Chen, David Dobkin, ...
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths (1996)
Danny Chen, Danny Z. Chen, Gautam Das, Michiel Smid
We consider the problems of constructing geometric spanners, possibly containing Steiner points, for sets of points in the d-dimensional space IR d , and constructing spanners and approximate...
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths (1996)
Danny Z. Chen, Gautam Das, Michiel Smid
We consider the problems of constructing geometric spanners, possibly containing Steiner points, for sets of points in the d-dimensional space IR d , and constructing spanners and approximate...
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane (1996)
Srinivasa Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, Christos D. Zaroliagis
. We consider the problem of finding an obstacle-avoiding path between two points s and t in the plane, amidst a set of disjoint polygonal obstacles with a total of n vertices. The length of this...
Using Framed-Subspaces to Solve the 2-D and 3-D Weighted Region Problem (1996)
Danny Z. Chen, Robert J. Szczerba, Robert J. Szczerba
The standard shortest path planning problem determines a collision-free path of shortest distance between two distinct locations in an environment scattered with obstacles. This problem, in fact,...
Weighted Selection on Coarse-Grain Hypercubes (1995)
Given n weighted records distributed evenly among a p-processor hypercube, p n, we present efficient parallel algorithms for solving the weighted selection and related problems in the coarse-grain...
Danny Z. Chen, Robert Szczerba, Robert J. Szczerba
In this paper we study the problem of determining optimal paths in a dynamic, 2-D environment. We present a novel cell decomposition approach which generates optimal paths based on a number of...
Mikhail J. Atallah, Danny Z. Chen, D. T. Lee
We give the first linear-time algorithm for computing single-source shortest paths in a weighted interval or circular-arc graph, when we are given the model of that graph, i.e., the actual weighted...
A Grid-Based Approach For Finding Conditional Shortest Paths In An Unknown Environment (1994)
Danny Z. Chen, John J. Uhran, Robert J. Szczerba, Robert J. Szczerba
The problem of finding a shortest path through a known environment has been well studied. A more realistic and challenging problem is navigation through an unknown environment, where path planning is...