Sciweavers

254 search results - page 23 / 51
» Simplified Voronoi Diagrams
Sort
View
APVIS
2009
13 years 8 months ago
Visualizing metrics on areas of interest in software architecture diagrams
We present a new method for the combined visualization of software architecture diagrams, such as UML class diagrams or component diagrams, and software metrics defined on groups ...
Heorhiy Byelas, Alexandru Telea
ICDAR
2011
IEEE
12 years 7 months ago
Tuning between Exponential Functions and Zones for Membership Functions Selection in Voronoi-Based Zoning for Handwritten Charac
— In Handwritten Character Recognition, zoning is rigtly considered as one of the most effective feature extraction techniques. In the past, many zoning methods have been propose...
Sebastiano Impedovo, Giuseppe Pirlo
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
14 years 1 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
CCCG
2006
13 years 9 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink