Sciweavers

33 search results - page 5 / 7
» gd 2007
Sort
View
GD
2005
Springer
14 years 3 months ago
Drawing Kn in Three Dimensions with One Bend Per Edge
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
Olivier Devillers, Hazel Everett, Sylvain Lazard, ...
JCC
2007
151views more  JCC 2007»
13 years 9 months ago
New parallel algorithm for MP2 energy gradient calculations
Abstract: A new parallel algorithm has been developed for calculating the analytic energy derivatives of full accuracy second order Møller-Plesset perturbation theory (MP2). Its m...
Kazuya Ishimura, Peter Pulay, Shigeru Nagase
GD
2007
Springer
14 years 4 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
GD
2007
Springer
14 years 4 months ago
Simultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
Alejandro Estrella-Balderrama, Elisabeth Gassner, ...
COMPGEOM
2007
ACM
14 years 1 months ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...