-
1
-
-
0036523480
-
Deformable free space tilings for kinetic collision detection
-
Pankaj Agarwal, Julien Basch, Leonidas Guibas, John Hershberger, and Li Zhang. Deformable free space tilings for kinetic collision detection. International Journal of Robotics Research, 21(3):179-197, 2003.
-
(2003)
International Journal of Robotics Research
, vol.21
, Issue.3
, pp. 179-197
-
-
Agarwal, P.1
Basch, J.2
Guibas, L.3
Hershberger, J.4
Zhang, L.5
-
2
-
-
0942266548
-
Pseudo-triangulations from surfaces and a novel type of edge flip
-
Oswin Aichholzer, Franz Aurenhammer, P. Brass, and Hannes Krasser. Pseudo-triangulations from surfaces and a novel type of edge flip. SIAM Journal on Computing, 32:1621-1653, 2003.
-
(2003)
SIAM Journal on Computing
, vol.32
, pp. 1621-1653
-
-
Aichholzer, O.1
Aurenhammer, F.2
Brass, P.3
Krasser, H.4
-
3
-
-
0037700507
-
Spatial embedding of pseudo-triangulations
-
Oswin Aichholzer, Franz Aurenhammer, Peter Brass, and Hannes Krasser. Spatial embedding of pseudo-triangulations. In Proc. 19th Annual ACM Symposium on Computational Geometry, San Diego, California, volume 19, pages 144-153, 2003.
-
(2003)
Proc. 19th Annual ACM Symposium on Computational Geometry, San Diego, California
, vol.19
, pp. 144-153
-
-
Aichholzer, O.1
Aurenhammer, F.2
Brass, P.3
Krasser, H.4
-
4
-
-
35248878783
-
Adapting (pseudo)-triangulations with a near-linear number of edge flips
-
Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin
-
Oswin Aichholzer, Franz Aurenhammer, and Hannes Krasser. Adapting (pseudo)-triangulations with a near-linear number of edge flips. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS), pages 12-24. Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin, 2003.
-
(2003)
Proc. 8th International Workshop on Algorithms and Data Structures (WADS)
, pp. 12-24
-
-
Aichholzer, O.1
Aurenhammer, F.2
Krasser, H.3
-
5
-
-
84867974650
-
Convexity minimizes pseudo-triangulations
-
May
-
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, and Bettina Speckmann. Convexity minimizes pseudo-triangulations. Computational Geometry: Theory and Applications, 28(1):3-10, May 2004.
-
(2004)
Computational Geometry: Theory and Applications
, vol.28
, Issue.1
, pp. 3-10
-
-
Aichholzer, O.1
Aurenhammer, F.2
Krasser, H.3
Speckmann, B.4
-
6
-
-
0035479569
-
Reconfiguring convex polygons
-
October
-
Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael A. Soss, and Godfried T. Toussaint. Reconfiguring convex polygons. Computational Geometry: Theory and Applications, 20(1-2):85-95, October 2001.
-
(2001)
Computational Geometry: Theory and Applications
, vol.20
, Issue.1-2
, pp. 85-95
-
-
Aichholzer, O.1
Demaine, E.D.2
Erickson, J.3
Hurtado, F.4
Overmars, M.5
Soss, M.A.6
Toussaint, G.T.7
-
7
-
-
0942303538
-
Degree bounds for constrained pseudo-triangulations
-
Oswin Aichholzer, M. Hoffmann, Bettina Speckmann, and Csaba D. Tóth. Degree bounds for constrained pseudo-triangulations. In Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia, pages 155-158, 2003.
-
(2003)
Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia
, pp. 155-158
-
-
Aichholzer, O.1
Hoffmann, M.2
Speckmann, B.3
Tóth, C.D.4
-
8
-
-
30644479398
-
On the number of pseudo-triangulations of certain point sets
-
Oswin Aichholzer, David Orden, Francisco Santos, and Bettina Speckmann. On the number of pseudo-triangulations of certain point sets. In Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia, pages 141-144, 2003.
-
(2003)
Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia
, pp. 141-144
-
-
Aichholzer, O.1
Orden, D.2
Santos, F.3
Speckmann, B.4
-
9
-
-
35248889929
-
The zigzag path of a pseudo-triangulation
-
Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin
-
Oswin Aichholzer, Günter Rote, Bettina Speckmann, and Ileana Streinu. The zigzag path of a pseudo-triangulation. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS), pages 377-389. Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin, 2003.
-
(2003)
Proc. 8th International Workshop on Algorithms and Data Structures (WADS)
, pp. 377-389
-
-
Aichholzer, O.1
Rote, G.2
Speckmann, B.3
Streinu, I.4
-
10
-
-
0003597268
-
-
Springer-Verlag, New York. Translated from Russian, 3rd edition, 1984
-
Vladimir I. Arnol'd. Ordinary Differential Equations. Springer-Verlag, New York, 1992. Translated from Russian, 3rd edition, 1984.
-
(1992)
Ordinary Differential Equations
-
-
Arnol'D, V.I.1
-
15
-
-
0032762501
-
Kinetic collision detection between two simple polygons
-
Julien Basch, Jeff Erickson, Leonidas Guibas, John Hershberger, and Li Zhang. Kinetic collision detection between two simple polygons. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 102-111, 1999.
-
(1999)
Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 102-111
-
-
Basch, J.1
Erickson, J.2
Guibas, L.3
Hershberger, J.4
Zhang, L.5
-
16
-
-
0034411090
-
Computing roadmaps of semi-algebraic sets on a variety
-
Saugata Basu, Richard Pollack, and Marie-Francoise Roy. Computing roadmaps of semi-algebraic sets on a variety. Journal of the AMS, 13:55-82, 2000.
-
(2000)
Journal of the AMS
, vol.13
, pp. 55-82
-
-
Basu, S.1
Pollack, R.2
Roy, M.-F.3
-
19
-
-
0035601782
-
Locked and unlocked polygonal chains in three dimensions
-
October
-
Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete & Computational Geometry, 26(3):269-281, October 2001.
-
(2001)
Discrete & Computational Geometry
, vol.26
, Issue.3
, pp. 269-281
-
-
Biedl, T.1
Demaine, E.2
Demaine, M.3
Lazard, S.4
Lubiw, A.5
O'Rourke, J.6
Robbins, S.7
Streinu, I.8
Toussaint, G.9
Whitesides, S.10
-
20
-
-
84867972776
-
On reconfiguring tree linkages: Trees can lock
-
Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. On reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics, 117:293-297, 2002.
-
(2002)
Discrete Applied Mathematics
, vol.117
, pp. 293-297
-
-
Biedl, T.1
Demaine, E.2
Demaine, M.3
Lazard, S.4
Lubiw, A.5
O'Rourke, J.6
Robbins, S.7
Streinu, I.8
Toussaint, G.9
Whitesides, S.10
-
21
-
-
0004196915
-
-
Cambridge University Press, Cambridge
-
Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1999.
-
(1999)
Oriented Matroids
-
-
Björner, A.1
Vergnas, M.L.2
Sturmfels, B.3
White, N.4
Ziegler, G.5
-
22
-
-
0039719221
-
Oriented matroids
-
Peter Gruber and Jörg Wills, editors. North-Holland, Amsterdam
-
Jürgen Bokowski. Oriented matroids. In Peter Gruber and Jörg Wills, editors, Handbook of Convex Geometry, volumes A and B, pages 555-602. North-Holland, Amsterdam, 1993.
-
(1993)
Handbook of Convex Geometry
, vol.A AND B
, pp. 555-602
-
-
Bokowski, J.1
-
23
-
-
0035645211
-
On the Folkman-Lawrence topological representation theorem for oriented matroids in rank 3
-
Jürgen Bokowski, Susanne Mock, and Ileana Streinu. On the Folkman-Lawrence topological representation theorem for oriented matroids in rank 3. European Journal of Combinatorics, 22(5):601-615, 2001.
-
(2001)
European Journal of Combinatorics
, vol.22
, Issue.5
, pp. 601-615
-
-
Bokowski, J.1
Mock, S.2
Streinu, I.3
-
24
-
-
1642350131
-
The number of embeddings of minimally rigid graphs
-
Ciprian Borcea and Ileana Streinu. The number of embeddings of minimally rigid graphs. Discrete & Computational Geometry, 31:287-303, 2004.
-
(2004)
Discrete & Computational Geometry
, vol.31
, pp. 287-303
-
-
Borcea, C.1
Streinu, I.2
-
26
-
-
33749558092
-
Enumerating and counting pseudo-triangulations with the greedy flip algorithm
-
to appear
-
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink. Enumerating and counting pseudo-triangulations with the greedy flip algorithm. In Proc. ALENEX 2005, to appear.
-
Proc. ALENEX 2005
-
-
Brönnimann, H.1
Kettner, L.2
Pocchiola, M.3
Snoeyink, J.4
-
28
-
-
51249179364
-
Triangulating a simple polygon in linear time
-
Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete & Computational Geometry, 6(5):485-524, 1991.
-
(1991)
Discrete & Computational Geometry
, vol.6
, Issue.5
, pp. 485-524
-
-
Chazelle, B.1
-
30
-
-
0034514005
-
Straightening polygonal arcs and convexifying polygonal cycles
-
Robert Connelley, Erik Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California, pages 432-452, 2000.
-
(2000)
Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California
, pp. 432-452
-
-
Connelley, R.1
Demaine, E.2
Rote, G.3
-
32
-
-
0041323040
-
Infinitesimally locked self-touching linkages with applications to locked trees
-
Jorge Calvo, Kenneth Millett, and Eric Rawdon, editors, American Mathematical Society, Providence, RI. Collection of papers from the Special Session on Physical Knotting and Unknotting at the AMS Spring Western Section Meeting, Las Vegas, Nevada, April 21-22, 2001
-
3, pages 287-311. American Mathematical Society, Providence, RI, 2002. Collection of papers from the Special Session on Physical Knotting and Unknotting at the AMS Spring Western Section Meeting, Las Vegas, Nevada, April 21-22, 2001.
-
(2002)
3
, pp. 287-311
-
-
Connelly, R.1
Demaine, E.D.2
Rote, G.3
-
34
-
-
0001878937
-
Plane self-stresses and projected polyhedra, I: The basic pattern
-
Henri Crapo and Walter Whiteley. Plane self-stresses and projected polyhedra, I: the basic pattern. Structural Topology, 20:55-77, 1993.
-
(1993)
Structural Topology
, vol.20
, pp. 55-77
-
-
Crapo, H.1
Whiteley, W.2
-
37
-
-
0001114105
-
Almost all simply connected closed surfaces are rigid
-
Lecture Notes in Mathematics 438. Springer-Verlag, Berlin
-
Herman Gluck. Almost all simply connected closed surfaces are rigid. In Geometric Topology, pages 225-239. Lecture Notes in Mathematics 438. Springer-Verlag, Berlin, 1975.
-
(1975)
Geometric Topology
, pp. 225-239
-
-
Gluck, H.1
-
38
-
-
0001302946
-
Allowable sequences and order types in discrete and computational geometry
-
János Pach, editor. Springer-Verlag, New York
-
Jacob E. Goodman and Richard Pollack. Allowable sequences and order types in discrete and computational geometry. In János Pach, editor, New Trends in Discrete and Computational Geometry. Springer-Verlag, New York, 1993.
-
(1993)
New Trends in Discrete and Computational Geometry
-
-
Goodman, J.E.1
Pollack, R.2
-
39
-
-
0004018627
-
-
Graduate Studies in Mathematics. American Mathematical Society, Providence, RI
-
Jack Graver, Brigitte Servatius, and Herman Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics, vol. 2. American Mathematical Society, Providence, RI, 1993.
-
(1993)
Combinatorial Rigidity
, vol.2
-
-
Graver, J.1
Servatius, B.2
Servatius, H.3
-
40
-
-
0023247608
-
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
-
Leonidas J. Guibas, John Hershberger, D. Leven, Micha Sharir, and Robert E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
-
(1987)
Algorithmica
, vol.2
, pp. 209-233
-
-
Guibas, L.J.1
Hershberger, J.2
Leven, D.3
Sharir, M.4
Tarjan, R.E.5
-
41
-
-
84942026338
-
Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams
-
Leonidas Guibas and Jorje Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4:74-123, 1985.
-
(1985)
ACM Transactions on Graphics
, vol.4
, pp. 74-123
-
-
Guibas, L.1
Stolfi, J.2
-
42
-
-
84867952044
-
Planar minimally rigid graphs and pseudo-triangulations
-
May
-
Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley. Planar minimally rigid graphs and pseudo-triangulations. Computational Geometry: Theory and Applications, 31(1-2):31-61, May 2005.
-
(2005)
Computational Geometry: Theory and Applications
, vol.31
, Issue.1-2
, pp. 31-61
-
-
Haas, R.1
Orden, D.2
Rote, G.3
Santos, F.4
Servatius, B.5
Servatius, H.6
Souvaine, D.7
Streinu, I.8
Whiteley, W.9
-
45
-
-
0022061705
-
On the movement of robot arms in 2-dimensional bounded regions
-
John Hopcroft, Deborah Joseph, and Sue Whitesides. On the movement of robot arms in 2-dimensional bounded regions. SIAM Journal of Computing, 14:315-333, 1985.
-
(1985)
SIAM Journal of Computing
, vol.14
, pp. 315-333
-
-
Hopcroft, J.1
Joseph, D.2
Whitesides, S.3
-
47
-
-
0039336010
-
On the moduli spaces of polygons in the euclidean plane
-
Micha Kapovich and John Millson. On the moduli spaces of polygons in the euclidean plane. Journal of Differential Geometry, 42(1): 133-164, 1995.
-
(1995)
Journal of Differential Geometry
, vol.42
, Issue.1
, pp. 133-164
-
-
Kapovich, M.1
Millson, J.2
-
49
-
-
84867931246
-
Tight degree bounds for pseudo-triangulations of points
-
Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, and Fumihiko Takeuchi. Tight degree bounds for pseudo-triangulations of points. Computational Geometry Theory and Applications, 25:1-12, 2003.
-
(2003)
Computational Geometry Theory and Applications
, vol.25
, pp. 1-12
-
-
Kettner, L.1
Kirkpatrick, D.2
Mantler, A.3
Snoeyink, J.4
Speckmann, B.5
Takeuchi, F.6
-
51
-
-
0036002805
-
Kinetic collision detection for simple polygons
-
David Kirkpatrick, Jack Snoeyink, and Bettina Speckmann. Kinetic collision detection for simple polygons. International Journal of Computational Geometry and Applications, 12(1 and 2):3-27, 2002.
-
(2002)
International Journal of Computational Geometry and Applications
, vol.12
, Issue.1-2
, pp. 3-27
-
-
Kirkpatrick, D.1
Snoeyink, J.2
Speckmann, B.3
-
52
-
-
0036361572
-
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
-
David Kirkpatrick and Bettina Speckmann. Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. In Proc. 18th ACM Symposium on Computational Geometry (SoCG), pages 179-188, 2002.
-
(2002)
Proc. 18th ACM Symposium on Computational Geometry (SoCG)
, pp. 179-188
-
-
Kirkpatrick, D.1
Speckmann, B.2
-
53
-
-
0014856102
-
On graphs and rigidity of plane skeletal structures
-
G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4:331-340, 1970.
-
(1970)
Journal of Engineering Mathematics
, vol.4
, pp. 331-340
-
-
Laman, G.1
-
56
-
-
30644479236
-
-
Barbados. McGill University Bellairs Institute. Informal proceedings
-
Anna Lubiw and Sue Whitesides, editors. Workshop on Folding and Unfolding, Barbados, 1998. McGill University Bellairs Institute. Informal proceedings.
-
(1998)
Workshop on Folding and Unfolding
-
-
Lubiw, A.1
Whitesides, S.2
-
57
-
-
0001766634
-
On reciprocal figures and diagrams of forces
-
James Clerk Maxwell. On reciprocal figures and diagrams of forces. Philosphical Magazine, 27:250-261, 1864.
-
(1864)
Philosphical Magazine
, vol.27
, pp. 250-261
-
-
Maxwell, J.C.1
-
58
-
-
84958469724
-
On reciprocal figures, frameworks and diagrams of forces
-
James Clerk Maxwell. On reciprocal figures, frameworks and diagrams of forces. Transactions of the Royal Society Edinburgh, 26:1-40, 1870.
-
(1870)
Transactions of the Royal Society Edinburgh
, vol.26
, pp. 1-40
-
-
Maxwell, J.C.1
-
59
-
-
30644471140
-
On Bow's method of drawing diagrams in graphical statics, with illustrations from Peaucellier's linkage
-
James Clerk Maxwell. On Bow's method of drawing diagrams in graphical statics, with illustrations from Peaucellier's linkage. Cambridge Philosophical Society Proceedings, 2:407-414, 1876.
-
(1876)
Cambridge Philosophical Society Proceedings
, vol.2
, pp. 407-414
-
-
Maxwell, J.C.1
-
60
-
-
17544378876
-
The geometry of configuration spaces for closed chains in two and three dimensions
-
R. James Milgram and Jeff C. Trinkle. The geometry of configuration spaces for closed chains in two and three dimensions. Homology Homotopy and Applications, 6(1):237-267, 2004.
-
(2004)
Homology Homotopy and Applications
, vol.6
, Issue.1
, pp. 237-267
-
-
James Milgram, R.1
Trinkle, J.C.2
-
61
-
-
84922429329
-
-
David Orden, Guenter Rote, Francisco Santos, Brigitte Servatios, Herman Servatius, and Walter Whiteley. Non-crossing frameworks with non-crossing reciprocals. http:/arxiv.org/abs/math.MG/0309156, 2003.
-
(2003)
Non-crossing Frameworks with Non-crossing Reciprocals
-
-
Orden, D.1
Rote, G.2
Santos, F.3
Servatios, B.4
Servatius, H.5
Whiteley, W.6
-
62
-
-
12944273406
-
The polytope of non-crossing graphs on a planar point set
-
David Orden and Francisco Santos. The polytope of non-crossing graphs on a planar point set. Discrete. & Computational Geometry, 33(2):275-305, 2005.
-
(2005)
Discrete. & Computational Geometry
, vol.33
, Issue.2
, pp. 275-305
-
-
Orden, D.1
Santos, F.2
-
65
-
-
0030519977
-
Topologically sweeping visibility complexes via pseudo-triangulations
-
Michel Pocchiola and Gert Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete & Computational Geometry, 16(4):419-453, 1996.
-
(1996)
Discrete & Computational Geometry
, vol.16
, Issue.4
, pp. 419-453
-
-
Pocchiola, M.1
Vegter, G.2
-
67
-
-
0005449455
-
Counting triangulations and pseudo-triangulations of wheels
-
Dana Randall, Günter Rote, Francisco Santos, and Jack Snoeyink. Counting triangulations and pseudo-triangulations of wheels. In Proc. 13th Canadian Conference on Computational Geometry, pages 149-152, 2001. http:/compgeo.math.uwaterloo.ca/cccg01/proceedings.
-
(2001)
Proc. 13th Canadian Conference on Computational Geometry
, pp. 149-152
-
-
Randall, D.1
Rote, G.2
Santos, F.3
Snoeyink, J.4
-
70
-
-
0041323039
-
Expansive motions and the polytope of pointed pseudo-triangulations
-
Janos Pach, Boris Aronov, Saugata Basu and Micha Sharir, editors. Algorithms and Combinatorics. Springer-Verlag, Berlin
-
Günter Rote, Francisco Santos, and Ileana Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In Janos Pach, Boris Aronov, Saugata Basu and Micha Sharir, editors, Discrete and Computational Geometry - The Goodman-Pollack Festschrift, pages 699-736. Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003.
-
(2003)
Discrete and Computational Geometry - The Goodman-pollack Festschrift
, pp. 699-736
-
-
Rote, G.1
Santos, F.2
Streinu, I.3
-
71
-
-
35248859666
-
On constrained minimum pseudo triangulations
-
Lecture Notes in Computer Science 2697. Springer-Verlag, Berlin, 2003
-
Günter Rote, Cao An Wang, Lusheng Wang, and Yinfeng Xu. On constrained minimum pseudo triangulations. In Proc. 9th Annual International Conference on Computing and Combinatorics, COCOON 2003, Big Sky, MT, July 25-28, 2003, pages 445-454. Lecture Notes in Computer Science 2697. Springer-Verlag, Berlin, 2003.
-
(2003)
Proc. 9th Annual International Conference on Computing and Combinatorics, COCOON 2003, Big Sky, MT, July 25-28
, pp. 445-454
-
-
Rote, G.1
Wang, C.A.2
Wang, L.3
Xu, Y.4
-
72
-
-
0347647219
-
On the piano mover's problem, II: General techniques for computing topological properties of real algebraic manifolds
-
Jack Schwartz and Micha Sharir. On the piano mover's problem, II: general techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics, 4:298-351, 1983.
-
(1983)
Advances in Applied Mathematics
, vol.4
, pp. 298-351
-
-
Schwartz, J.1
Sharir, M.2
-
73
-
-
12944275457
-
Allocating vertex π-guards in simple polygons via pseudo-triangulations
-
Bettina Speckmann and Csaba Tóth. Allocating vertex π-guards in simple polygons via pseudo-triangulations. Discrete & Computational Geometry, 33:345-364, 2005.
-
(2005)
Discrete & Computational Geometry
, vol.33
, pp. 345-364
-
-
Speckmann, B.1
Tóth, C.2
-
75
-
-
0034504512
-
A combinatorial approach to planar non-colliding robot arm motion planning
-
Ileana Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. ACM/IEEE Symposium on Foundations of Computer Science, pages 443-453, 2000.
-
(2000)
Proc. ACM/IEEE Symposium on Foundations of Computer Science
, pp. 443-453
-
-
Streinu, I.1
-
78
-
-
30644470887
-
Parallel redrawing mechanisms, pseudo-triangulation, and kinetic planar graphs
-
To appear, Limerick, Ireland, Sept.
-
Ileana Streinu. Parallel redrawing mechanisms, pseudo-triangulation, and kinetic planar graphs. To appear in Proc. Graph Drawing, Limerick, Ireland, Sept. 2005.
-
(2005)
Proc. Graph Drawing
-
-
Streinu, I.1
-
82
-
-
0036767834
-
Complete path planning for closed kinematic chains with spherical joints
-
Jeff C. Trinkle and R. James Milgram. Complete path planning for closed kinematic chains with spherical joints. International Journal of Robotics Research, 21(9):773-789, 2002.
-
(2002)
International Journal of Robotics Research
, vol.21
, Issue.9
, pp. 773-789
-
-
Trinkle, J.C.1
James Milgram, R.2
-
83
-
-
0003128910
-
Motions and stresses of projected polyhedra
-
Walter Whiteley. Motions and stresses of projected polyhedra. Structural Topology, 7:13-38, 1982.
-
(1982)
Structural Topology
, vol.7
, pp. 13-38
-
-
Whiteley, W.1
-
84
-
-
0002856165
-
Some matroids from discrete applied geometry
-
J. Oxley, J. Bonin and B. Servatius, editors, Volume 197 of Contemporary Mathematics. American Mathematical Society, Providence, RI
-
Walter Whiteley. Some matroids from discrete applied geometry. In J. Oxley, J. Bonin and B. Servatius, editors, Matroid Theory, pages 171-311. Volume 197 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1996.
-
(1996)
Matroid Theory
, pp. 171-311
-
-
Whiteley, W.1
-
85
-
-
0010251249
-
Rigidity and scene analysis
-
Jacob E. Goodman and Joseph O'Rourke, editors. CRC Press, Boca Raton, FL
-
Walter Whiteley. Rigidity and scene analysis. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, 1st edn., pages 893-916. CRC Press, Boca Raton, FL, 1997.
-
(1997)
Handbook of Discrete and Computational Geometry, 1st Edn.
, pp. 893-916
-
-
Whiteley, W.1
|