Sciweavers

691 search results - page 22 / 139
» Axiomatizing geometric constructions
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 15 days ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
GMP
2000
IEEE
173views Solid Modeling» more  GMP 2000»
15 years 4 months ago
A Representation Independent Geometric Modeling Kernel
This paper is concerned with “open kernel” geometric modelling systems. It uses industrial needs to identify requirements for the geometric objects of a proposed interface. Th...
Alan E. Middleditch, Chris Reade, Abel J. P. Gomes
104
Voted
VISUALIZATION
1995
IEEE
15 years 4 months ago
3D Computational Steering with Parametrized Geometric Objects
Computational Steering is the ultimate goal of interactive simulation: researchers change parameters of their simulation and immediately receive feedback on the effect. We present...
Jurriaan D. Mulder, Jarke J. van Wijk
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
15 years 15 days ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
JGO
2008
111views more  JGO 2008»
15 years 11 days ago
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Angelia Nedic, Asuman E. Ozdaglar