Walter Whiteley

Dr. Walter Whiteley


Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 August 2009 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
RCRobert Connelly
Robert Connelly
WWWalter Whiteley
Walter Whiteley

29 December 2010 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
BSBernd Schulze
Bernd Schulze
WWWalter Whiteley
Walter Whiteley

1 January 2006
Verified
Conference Paper
Closed access
TETolga Eren
Tolga Eren
WWWalter Whiteley
Walter Whiteley
PBPeter N. Belhumeur
Peter N. Belhumeur
In this paper, we consider using angle of arrival information (bearing) for sensor network localization. The essential property we require in this paper is that a node can infer heading information from its neighbors. We address the uniqueness of network localization solutions by the theory of globally rigid graphs. We show that while the parallel rigidity problem for formations with bearings is isomorphic to the distance case, the global rigidity of the formation is simpler (in fact identical to the simpler rigidity case) for a network with bearings, compared to formations with distances

11 February 2012
Verified
Book Chapter
Open access
PDF file
DTDavid Tall
David Tall
OYOleksiy Yevdokimov
Oleksiy Yevdokimov
BKBoris Koichu
Boris Koichu
WWWalter Whiteley
Walter Whiteley
MKMargo Kondratieva
Margo Kondratieva
YCYing-Hao Cheng
Ying-Hao Cheng
This chapter traces the long-term cognitive development of mathematical proof from the young child to the frontiers of research. It uses a framework building from perception and action, through proof by embodied actions and classifications, geometric proof and operational proof in arithmetic and algebra, to the formal set-theoretic definition and formal deduction. In each context, proof develops over the long-term from the recognition and description of observed properties and the links between them, the selection of specific properties that can be used as definitions from which other properties may be deduced, to the construction of ‘crystalline concepts’ whose properties are a consequence of the context. These include Platonic objects in geometry, symbols having relationships in arithmetic and algebra and formal axiomatic systems whose properties are determined by their definitions.

4 May 2012 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
BSBernd Schulze
Bernd Schulze
WWWalter Whiteley
Walter Whiteley

19 August 2004 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
David Orden MartínDavid Orden Martín
David Orden Martín
GRGünter Rote
Günter Rote
FSFrancisco Santos
Francisco Santos
Brigitte ServatiusBrigitte Servatius
Brigitte Servatius
HSHerman Servatius
Herman Servatius
WWWalter Whiteley
Walter Whiteley
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.