Sciweavers

3299 search results - page 247 / 660
» A general mathematics of names
Sort
View
JVCA
2006
140views more  JVCA 2006»
15 years 6 months ago
A fast triangle to triangle intersection test for collision detection
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
Oren Tropp, Ayellet Tal, Ilan Shimshoni
TALG
2008
97views more  TALG 2008»
15 years 6 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ACS
2004
15 years 6 months ago
One Setting for All: Metric, Topology, Uniformity, Approach Structure
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...
CSUR
2004
91views more  CSUR 2004»
15 years 6 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
AUTOMATICA
1999
119views more  AUTOMATICA 1999»
15 years 6 months ago
Robust L2-gain control for nonlinear systems with projection dynamics and input constraints: an example from traffic control
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
Joseph A. Ball, Martin V. Day, Tungsheng Yu, Pushk...