Daniel Russel

dblp:44/1767 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2007
0000-0002-0225-6654ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorTheory of computation · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 87% Combinatorics and discrete mathematics · 13%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › triangulation
delaunay triangulation
0.012004
An empirical comparison of techniques for updating Delaunay triangulations · SCG 2004
Computational geometry › triangulation › delaunay triangulation
incremental delaunay triangulation
0.012004
An empirical comparison of techniques for updating Delaunay triangulations · SCG 2004
Computational geometry › geometric data structures
kinetic data structures
0.012004
An empirical comparison of techniques for updating Delaunay triangulations · SCG 2004
Geometric modeling and processing
collision detection
0.012002
Collision detection for deforming necklaces · SCG 2002
Geometric modeling and processing › collision detection
self-collision detection
0.012002
Collision detection for deforming necklaces · SCG 2002
Computational geometry › geometric data structures
bounding volume hierarchy
0.012002
Collision detection for deforming necklaces · SCG 2002
Computational geometry › geometric intersection
collision detection
0.012002
Collision detection for deforming necklaces · SCG 2002
Computational geometry
geometric data structures
0.012002
Collision detection for deforming necklaces · SCG 2002
Combinatorics and discrete mathematics › combinatorics on words
necklaces
0.012002
Collision detection for deforming necklaces · SCG 2002

Methods — techniques the papers use, named apart from their topics

power diagram · 0.1bounding volume hierarchy · 0.1physical simulation · 0.0
YearPublicationVenuePosition
2007 A package for exact kinetic data structures and sweepline algorithms
Daniel Russel, Menelaos I. Karavelas, Leonidas J. Guibas
Comput. Geom.1
2004 An empirical comparison of techniques for updating Delaunay triangulations
abstract
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic data structures can be used to maintain the triangulation. However, there has been little work so far on how to maintain the triangulation when the points move without explicit motion plans, as in the case of a physical simulation. In this paper we examine how to update Delaunay triangulations after small displacements of the defining points, as might be provided by a physics-based integrator. We have implemented a variety of update algorithms, many new, toward this purpose. We ran these algorithms on a corpus of data sets to provide running time comparisons and determined that updating Delaunay can be significantly faster than recomputing.
Leonidas J. Guibas, Daniel Russel
SCG2
2004 Collision detection for deforming necklaces
Pankaj K. Agarwal, Leonidas J. Guibas, An Thai Nguyen, Daniel Russel, Li Zhang 0001
Comput. Geom.4
2002 Collision detection for deforming necklaces
abstract
In this paper, we propose to study deformable necklaces --- flexible chains of balls, called beads, in which only adjacent balls may intersect. Such objects can be used to model macro-molecules, muscles, rope, and other 'linear' objects in the physical world. In this paper, we exploit this linearity to develop geometric structures associated with necklaces that are useful in physical simulations. We show how these structures can be implemented efficiently and maintained under necklace deformation. In particular, we study a bounding volume hierarchy based on spheres built on a necklace. Such a hierarchy is easy to compute and is suitable for maintenance when the necklace deforms, as our theoretical and experimental results show. This hierarchy can be used for collision and self-collision detection. In particular, we achieve an upper bound of O(nlog n) in two dimensions and O(n 2-2/d) in d-dimensions, d 3, for collision checking. To our knowledge, this is the first sub-quadratic bound proved for a collision detection algorithm using predefined hierarchies. In addition, we show that the power diagram, with the help of some additional mechanisms, can be also used to detect self-collisions of a necklace in certain ways complementary to the sphere hierarchy.
Leonidas J. Guibas, Daniel Russel, Li Zhang 0001
SCG3