scispace - formally typeset
M

Menelaos I. Karavelas

Researcher at University of Crete

Publications -  48
Citations -  824

Menelaos I. Karavelas is an academic researcher from University of Crete. The author has contributed to research in topics: Voronoi diagram & Weighted Voronoi diagram. The author has an hindex of 15, co-authored 48 publications receiving 802 citations. Previous affiliations of Menelaos I. Karavelas include Stanford University & Foundation for Research & Technology – Hellas.

Papers
More filters
Journal ArticleDOI

Scalable nonlinear dynamical systems for agent steering and crowd simulation

TL;DR: A new methodology for agent modeling that is scalable and efficient, based on the integration of nonlinear dynamical systems and kinetic data structures is presented, which together model 3D agent steering, crowds and flocks among moving and static obstacles.
Proceedings ArticleDOI

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres

TL;DR: The equivalence relationship between additively weighted Voronoi cells and convex hulls of spheres permits us to compute a single additively Weight Vor onoi cel1 in dimension d in worst case optimal time.
Journal ArticleDOI

The predicates of the Apollonius diagram: algorithmic analysis and implementation

TL;DR: A complete algorithmic analysis of the predicates involved in an efficient dynamic algorithm for computing the Apollonius diagram in the plane, also known as the additively weighted Voronoi diagram, and some of which are reduced to simpler and more easily computed primitives are presented.
Book ChapterDOI

Dynamic Additively Weighted Voronoi Diagrams in 2D

TL;DR: In this article, the authors presented a dynamic algorithm for the construction of the additively weighted Voronoi diagram of a set of weighted points in the plane, which allows to perform both insertions and deletions of sites easily.
Proceedings ArticleDOI

Experimental evaluation and cross-benchmarking of univariate real solvers

TL;DR: This paper is focused on the comparison of black-box implementations of state-of-the-art algorithms for isolating real roots of univariate polynomials over the integers and indicates that for most instances the solvers based on Continued Fractions are among the best methods.