Sciweavers

2081 search results - page 44 / 417
» L-systems in Geometric Modeling
Sort
View
108
Voted
ADHOCNOW
2008
Springer
15 years 1 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
MOBIHOC
2007
ACM
16 years 3 days ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 6 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
128
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
107
Voted
CCCG
2008
15 years 2 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia