D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: the motion space approach. In Proc. ACM Symposium on Computational Geometry, pages 9--18, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Reasoning About Translational Motions - Schwarzer (2000) (Correct)
....along the fixed axes. In contrast, in an assembly planning application, interacting pairs may change during the removal motions. Separability and assembly planning. Toussaint [69] surveys earlier methods for separating sets in two and three dimensions. For recent surveys on assembly planning, cf. [12, 22]. Geometric assembly planning is studied in [71] An application of separability in medicine is described in [30] Agarwal, de Berg, Halperin and Sharir [1] consider sequences of translations for separating polyhedra. There, the set of allowed motion directions is assumed to be given in advance. ....
D. Halperin, J.-C. Latombe, and R.H. Wilson. A general framework for assembly planning: The motion space approach. In Proc. of the 14th Annual ACM Symposium on Computational Geometry, Minneapolis, Minnesota, 1998.
Efficient and Small Representation of Line Arrangements with.. - Dobkin, Tal (2001) (1 citation) (Correct)
....Engineering] Metrics complexity measures, performance measures 1. INTRODUCTION The line arrangement is a fundamental data structure for computational geometry problems. The list of application areas where line arrangements are used includes motion planning [38, 20, 29] assembly planning [19, 21], aspect graphs [17, 1] molecular modeling [22] hidden surface removal and visibility computations [32, 35] largest empty polygons [16, 11] ham sandwich cuts [15] and the computation of the discrepancy of point sets for sampling applications [10, 9, 5] There has also been considerable ....
D. Halperin, J.-C. Latombe, and R. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 26:577--601, 2000.
Disassembly Sequencing Using a Motion Planning Approach - Sundaram, Remmler, Amato (2001) (1 citation) (Correct)
....Wolter [28] analyses and reports di erent schemes and data structures used in assembly planning. Constraint Languages have also been commonly used for assembly planning [29, 16] Virtual Reality has also been utilized to help realize better disassemblability [7] Halperin, Latombe and Wilson [10] used a motion planning approach with the NDBG to realize a motion space scheme, which is similar to the con guration space scheme used in motion planning. In this work, the applicability of motion planning techniques to the disassembly problem is considered. While complete motion planning ....
D. Halperin, J-C. Latombe, and R. Wilson. A general framework for assembly planning: The motion space approach. In Proc. ACM Symp. on Computational Geometry (SoCG), 1998.
Emerging Challenges in Computational Topology - Bern, Eppstein, al. (1999) (2 citations) (Correct)
....planning the motion of a point in F . In other words, the motion planning problems map to connectivity questions, or related topological questions, in F . Many other problems can be couched in terms of configuration spaces. Important examples include assembly planning and molecular docking [HKL97,HLW97,Lat91] The topology of configuration spaces is little understood, except in very rudimentary cases, such as that of an object under rigid motion. Representation and Computation. Most interesting configuration spaces are semialgebraic sets, finite Boolean combinations of solution sets of ....
Dan Halperin, Jean-Claude Latombe, and Randall H. Wilson. A general framework for assembly planning: The motion space approach. Unpublished manuscript, 1997.
Polygon Decomposition for Efficient Construction of.. - Agarwal, Flato, Halperin (2000) Self-citation (Halperin) (Correct)
....decomposition perform very well. 1 Introduction Given two sets P and Q in IR 2 , their Minkowski sum (or vector sum) denoted by P Phi Q, is the set fp q j p 2 P; q 2 Qg. Minkowski sums are used in a wide range of applications, including robot motion planning [26] assembly planning [16], computer aided design and P.A. is supported by Army Research Office MURI grant DAAH04 96 1 0013, by a Sloan fellowship, by NSF grants EIA 9870724, EIA 997287, and CCR 9732787 and by a grant from the U.S. Israeli Binational Science Foundation. D.H. and E.F. have been supported in part by ....
D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 26:577--601, 2000.
Robust and Efficient Construction of Planar Minkowski Sums - Flato, Halperin (2000) (1 citation) Self-citation (Halperin) (Correct)
....of a line segment or a singular point. 1 Introduction Given two sets P and Q in IR 2 , their Minkowski sum (or vector sum) denoted by P Q, is the set fp q j p 2 P; q 2 Qg. Minkowski sums are used in a wide range of applications, including robot motion planning [11] assembly planning [8], and computeraided design and manufacturing (CAD CAM ) 2] Consider for example an obstacle P and a robot Q that moves by translation. We can choose a reference point r rigidly attached to Q and suppose that Q is placed such that the reference point coincides with This work has been ....
D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 19-28, 1998. To appear in Algorithmica.
Polygon Decomposition for Efficient Construction of.. - Agarwal, Flato, Halperin (1999) Self-citation (Halperin) (Correct)
....optimal decomposition perform very well. 1 Introduction Given two sets P and Q in IR 2 , their Minkowski sum (or vector sum) denoted by P Q, is the set fp q j p 2 P; q 2 Qg. Minkowski sums are used in a wide range of applications, including robot motion planning [26] assembly planning [16], computer aided design and P.A. is supported by Army Research Oce MURI grant DAAH04 96 1 0013, by a Sloan fellowship, by NSF grants EIA 9870724, EIA 997287, and CCR 9732787 and by a grant from the U.S. Israeli Binational Science Foundation. D.H. and E.F. have been supported in part by ESPRIT ....
D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 26:577-601, 2000.
Robust Geometric Computing in Motion - Halperin (2000) (2 citations) Self-citation (Halperin) (Correct)
....oating point arithmetic. 4.1 Exact Polygonal Minkowski Sums Given two sets P and Q in IR 2 , their Minkowski sum (or vector sum) denoted by P Q, is the set fp q j p 2 P; q 2 Qg. Minkowski sums are used in a wide range of applications, including robot motion planning [58] assembly planning [47], and computer aided design and manufacturing (CAD CAM ) 33] Consider for example a planar setting with an obstacle P and a robot Q that moves by translation. We can choose a reference point r rigidly attached to Q and suppose that Q is placed such that the reference point coincides with the ....
D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: The motion space approach. In Proc. 14th ACM Symp. on Comput. Geom., pages 9-18, 1998.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
D. Halperin, J.-C. Latombe, and R. H. Wilson. A general framework for assembly planning: the motion space approach. In Proc. ACM Symposium on Computational Geometry, pages 9--18, 1998.
Constraint-Based Motion Planning for Virtual Prototyping - Garber, Lin (2002) (Correct)
No context found.
D. Halperin, J. Latombe, and R. Wilson. A general framework for assembly planning: The motion space approach. Algorithmica, 1999.
Complexity Measures for Assembly Sequences - Goldwasser, Motwani (1999) (10 citations) (Correct)
No context found.
D. Halperin, J.-C. Latombe, and R. H. Wilson, "A general framework for assembly planning: The motion space approach," in Proc. 14th Annual Symp. on Computational Geometry, Minneapolis, Minnesota, June 1998. To appear in Algorithmica.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC