##### KMap

#### VOSviewer

##### Courses

- CGComputer Graphics
- ATSAHNOAdvanced Topic: Sensor and Ad Hoc Network Optimization
- ADSAnalysis of Discrete Structures
- DAADesign and Analysis of Algorithms
- GAGeometric Algorithms
- AAlgorithms

##### Grants

- Special-Temporal Density Estimation from Seismic Multilateration Results
Principal Investigator (PI)

2021

###### $60.0K

- Support for the Modernization of Minor Planet Center Asteroid Catalog and Asteroid Discovery Tools
Principal Investigator (PI)

2012

###### $154.8K

- TC: Small: Collaborative Research: Protecting Networks from Large-Scale Physical Attacks and Disasters
Principal Investigator (PI)

2010

###### $144.8K

- NSF Industry/ University Cooperative Research Center for Autonomic Computing (Membership Agreement)
Co-Investigator (COI)

2008

###### $517.5K

- Career: Pattern Matching, Realistic Input Models and Sensor Placement. Useful Algorithms in Computational Geometry
Principal Investigator (PI)

2004

###### $427.2K

##### Technologies / Patents

##### News

- Improving Software for Asteroid Detection
2012

- Researchers Work to Protect, Restore Vulnerable Networks
2010

- UA's Aerial Robotics Club Moves a Giant Step Closer to $40,000 Prize
2003

##### Publications (121)

Recent

- Clustering and Order-Preserving Matching
2021

- Computing $beta$-Stretch Paths in Drawings of Graphs
2020

- New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs
2019

- Nearest-Neighbor Searching Under Uncertainty I
2017

- BBTM: New life for old ATM paradigms
2016

- 2015 17th International Conference on E-Health Networking, Application and Services, HealthCom 2015
2016

- Algorithms for Sensor Systems - 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers
2015

- Robust data mule networks with remote healthcare applications in the Amazon region: A fountain code approach
2015

- Data recovery after geographic correlated attacks.
2015

- Shortest Path to a Segment and Quickest Visibility Queries
2015

- Secure Communication through Jammers Jointly Optimized in Geography and Time
2015

- Memory efficient and scalable address mapping for flash storage devices
2014

- On Geometric Optimisation of Friendly Jamming
2014

- Hybrid algorithms for scheduling sensors for guarding polygonal domains
2014

- MapSets: visualizing embedded and clustered graphs
2014

- Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks
2014

- Healthcare Supported by Data Mule Networks in Remote Communities of the Amazon Region
2014

- Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks
2014

- Sweeping a terrain by collaborative aerial vehicles
2013

- Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
2013

- Cross-modality Indexing, Browsing and Search of Distance Learning Media on the Web
2013

- Collecting data in ad-hoc networks with reduced uncertainty
2013

- MobiSLIC: Content-Aware Energy Saving for Educational Videos on Mobile Devices
2013

- Efficient algorithms for pursuing moving evaders in terrains
2012

- Scandinavian thins on top of cake: On the smallest one-size-fits-all box
2012

- Optimization Schemes for Protective Jamming
2012

- Extent mapping scheme for flash memory devices
2012

- Client-side backprojection of presentation slides into educational video
2012

- Nearest-neighbor searching under uncertainty
2012

- Geographic max-flow and min-cut under a circular disk failure model
2012

- A new proposal of data mule network focused on amazon riverine population
2011

- Expanding the point: automatic enlargement of presentation video elements
2011

- The resilience of WDM networks to probabilistic geographical failures
2011

- Work in progress: A new proposal of data mule network focused on Amazon riverine population
2011

- Distributed localization and clustering using data correlation and the Occam's razor principle
2011

- Robust spatiotemporal matching of electronic slides to presentation videos
2011

- Retransmission and backoff strategies for wireless broadcasting
2010

- Network vulnerability to single, multiple, and probabilistic physical attacks
2010

- Improving and aligning speech with presentation slides
2010

- On approximate geodesic-distance queries amid deforming point clouds
2010

- Algorithm design for a class of base station location problems in sensor networks
2009

- Accurate alignment of presentation slides with educational video
2009

- Studying on the move-enriched presentation video for mobile devices
2009

- Geometric stable roommates
2009

- On the performance of the ICP algorithm
2008

- Guest editor's foreword
2008

- Temporal modeling of slide change in presentation videos
2007

- On matching robustness and geometric stable marriage
2007

- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
2007

- Fixed-Location Circular Arc Drawing of Planar Graphs.
2007

- NeuronMetrics: software for semi-automated processing of cultured neuron images
2007

- Fixed-location circular arc drawing of planar graphs
2007

- Buddy trackingâefficient proximity detection among mobile friends
2007

- Finding a guard that sees most and a shop that sells most
2007

- Matching slides to presentation videos using SIFT and scene background matching
2006

- Algorithm design for base station placement problems in sensor networks
2006

- Coverage time characteristics in sensor networks
2006

- On the ICP algorithm
2006

- Geometric Approaches to Ad Hoc and Sensor Networks: Full Report of the 2006 NSF Workshop
2006

- Shortest tour of a sequence of disjoint segments in L1
2006

- On the union of $\kappa$-round objects in three and four dimensions
2006

- The LSST moving object processing pipeline
2006

- Phenotypes of Drosophila brain neurons in primary culture reveal a role for fascin in neurite shape and trajectory
2006

- Force-directed approaches to sensor localization
2006

- The complexity of the union of ($\alpha$,$\beta$)-covered objects
2005

- Approximation algorithms for two optimal location problems in sensor networks
2005

- Hardware-Assisted Natural Neighbor Interpolation.
2005

- Design of low-complexity approximation algorithms for base station placement problems in sensor networks
2005

- Hardware-assisted natural neighbor interpolation
2005

- The complexity of the union of (α,β)-covered objects
2005

- Efficiently Tracking Moving Sources in the LSST
2005

- Buddy tracking - Efficient proximity detection among mobile friends
2004

- On the union of κ-round objects in three and four dimensions
2004

- On Finding a Guard that Sees Most and a Shop that Sells Most
2004

- Fixed-Location Circular-Arc Drawing of Planar Graphs
2004

- Search the audio, browse the video - A generic paradigm for video collections
2003

- Optimal motion strategies to track and capture a predictable target
2003

- Touring a sequence of polygons
2003

- On simultaneous planar graph embeddings
2003

- Finding a curve in a map
2003

- Optimal strategies to track and capture a predictable target
2003

- Matching planar maps
2003

- Covering with ellipses
2003

- Guarding galleries and terrains
2002

- Simultaneous Embedding of Planar Graphs
2002

- Growing fat graphs
2002

- Drawing with fat edges
2002

- New similarity measures between polylines with applications to morphing and polygon sweeping
2002

- Geometric algorithms for the analysis of 2D-electrophoresis gels
2001

- Efficient regular data structures and algorithms for dilation, location, and proximity problems
2001

- Using and determining location in a context-sensitive tour guide
2001

- On the number of regular vertices of the union of Jordan regions
2001

- Geometry helps in bottleneck matching and related problems
2001

- Fly cheaply: On the minimum fuel consumption problem
2001

- Advances in phonetic word spotting
2001

- Morphing between polylines
2001

- On the complexity of the union of fat convex objects in the plane
2000

- On incremental rendering of silhouette maps of a polyhedral scene
2000

- Computing Euclidean bottleneck matchings in higher dimensions
2000

- Sweeping simple polygons with a chain of guards
2000

- Dynamic data structures for fat objects and their applications
2000

- On the Union of $\kappa$-Curved Objects
1999

- Complexity of the union of (α, β)-covered objects
1999

- Efficient regular data structures and algorithms for location and proximity problems
1999

- Geometric pattern matching in d-dimensional space
1999

- On the union of κ-curved objects
1998

- Fly cheaply: On the minimum fuel-consumption problem
1998

- Separating and shattering long line segments
1997

- On the complexity of the union of fat objects in the plane
1997

- Computing fair and bottleneck matchings in geometric graphs
1996

- A near-linear algorithm for the planar segment-center problem
1996

- Improvements on bottleneck matching and related problems using geometry
1996

- Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
1995

- Computing the smallest k-enclosing circle and related problems
1994

- Near-linear algorithm for the planar segment center problem
1994

- Subpixel image registration using circular fiducials
1994

- Finding Maximally Consistent Sets of Halfspaces.
1993

- A Simple Algorithm for Maintaining the Center of a Planar Point-set.
1993

- Computing a segment center for a planar point set
1993

- On the union of fat wedges and separating a collection of segments by a line
1993

- Search the Audio, Browse the VideoâA Generic Paradigm for Video Collections
1900

Grants

Citations

H-Index

Patents

News

Books

Opportunities