Sciweavers

1801 search results - page 33 / 361
» Pointing without a pointer
Sort
View
MLQ
2002
67views more  MLQ 2002»
15 years 5 months ago
Intuitionistic Fixed Point Theories for Strictly Positive Operators
In this paper it is shown that the intuitionistic fixed point theory ID i (strict) for times iterated fixed points of strictly positive operator forms is conservative for negativ...
Christian Rüede, Thomas Strahm
GD
2004
Springer
15 years 11 months ago
Long Alternating Paths in Bicolored Point Sets
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
Jan Kyncl, János Pach, Géza Tó...
JCC
2002
74views more  JCC 2002»
15 years 5 months ago
Improved RGF method to find saddle points
: The predictor-corrector method for following a reduced gradient (RGF) to determine saddle points [Quapp, W. et al., J Comput Chem 1998, 19, 1087] is further accelerated by a modi...
Michael Hirsch, Wolfgang Quapp
GD
2007
Springer
16 years 2 days ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
DCG
2010
135views more  DCG 2010»
15 years 6 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...