Haim Kaplan, Edgar Ramos, Micha Sharir
In approximate halfspace range counting, one is given a set P of n points in R d, and an ε> 0, and the goal is to preprocess P into a data structure which can answer efficiently queries of the...
1B.3 Well-centered Planar Triangulation – An Iterative Approach (2008)
Evan V, Anil N. Hirani, Damrong Guoy, Edgar Ramos
Summary. We present an iterative algorithm to transform a given planar triangle mesh into a well-centered one by moving the interior vertices while keeping the connectivity fixed. A well-centered...
General Terms Algorithms (2008)
Siu-wing Cheng, Hong Kong, Stefan Funke, Mordecai Golin, Edgar Ramos
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from n noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves...
Well-Centered Triangulation (2008)
VanderZee, Evan, Hirani, Anil N., Guoy, Damrong, Ramos, Edgar
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We...
Intersection of Unit--Balls and Diameter of a Point Set in (2007)
. We describe an algorithm for computing the intersection of n balls of equal radius in IR 3 which runs in time O(n lg 2 n). The algorithm can be parallelized so that the comparisons that involve the...
Curve Reconstruction from Noisy Samples (2003)
Stefan Funke, Mordecai Golin, Piyush Kumar, Sheung-hung Poon, Edgar Ramos
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves...
Curve Reconstruction from Noisy Samples (2003)
Stefan Funke, Mordecai Golin, Piyush Kumar, Sheung-hung Poon, Edgar Ramos
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves...
Curve Reconstruction from Noisy Samples (2003)
Siu-wing Cheng, Stefan Funke, Mordecai Golin, Piyush Kumar, Sheung-hung Poon, Edgar Ramos
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves...
Curve Reconstruction from Noisy Samples (2003)
Siu-Wing Cheng, Stefan Funke, Mordecai Golin, Piyush Kuma, Sheung-hung Poon, Edgar Ramos
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves...
Fast Energy Optimal Routing in Radio Networks Using Geometric Data Structures \Lambda (2002)
Edgar Ramos, Peter S, Naveen Sivadasan
Abstract Given the current position of n nodes in a radio network, we discuss the problem of finding routes between pairs of nodes such that the energy consumption for this communication is...
Energy Optimal Routing in Radio Networks Using Geometric Data Structures (2002)
René Beier, Edgar Ramos, Peter Sanders, Peter S, Naveen Sivadasan
Given the current position of n sites in a radio network, we discuss the problem of finding routes between pairs of sites such that the energy consumption for this communication is minimized. Though...
Computing Faces in Segment and Simplex Arrangements (1995)
Nancy Amato, Michael Goodrich, Edgar Ramos
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel algorithm for constructing their arrangement. It runs in O(log 2 n) time using O(n log n + k) work...