SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 5, 2002, Pages 938-943

Planar reconfiguration of monotone trees

(3) Kusakari, Yoshiyuki a Sato, Masaki b Nishizeki, Takao c

a AKITA PREFECTURAL UNIVERSITY (Japan)

b Denso Wave Incorporated

c TOHOKU UNIVERSITY (Japan)

Author keywords

Linkage; Monotone tree; Planar reconfiguration

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING; TOPOLOGY;

LINE SEGMENTS; LINKAGE; MONOTONE TREES; PLANAR RECONFIGURATION; PLANE SWEEP METHOD; TRAPEZOIDALIZATION;

TREES (MATHEMATICS);

EID: 0036579388 PISSN: 09168508 EISSN: None Source Type: Journal
DOI: None Document Type: Article

Times cited : (3)

References (13)

1
- 0035479569
- Reconfiguring convex polygons
- (2001) Computational Geometry: Theory and Applications , vol.20 , Issue.1-2 , pp. 85-95
- Aichholzer, O.¹ Demaine, E.D.² Erickson, J.³ Hurtado, F.⁴ Overmars, M.⁵ Soss, M.A.⁶ Toussaint, G.T.⁷

2
- 84958056826
- Convexifying monotone polygons
- (1999) Proc. 10th International Symposium on Algorithms and Computation, LNCS 1741 , pp. 415-424
- Biedl, T.C.¹ Demaine, E.D.² Lazard, S.³ Robbins, S.M.⁴ Soss, M.A.⁵

3
- 85027119987
- On reconfiguring tree linkages: Trees can lock
- Proc. 10th Canadian Conference on Computational Geometry, 1998
- Biedl, T.¹ Demaine, E.² Demaine, M.³ Lazard, S.⁴ Lubiw, A.⁵ O'Rourke, J.⁶ Robbins, S.⁷ Streinu, I.⁸ Toussaint, G.⁹ Whitesides, S.¹⁰

4
- 84867972776
- A note on reconfiguring tree linkages: Trees can lock
- (2002) Discrete Applied Mathematics , vol.117 , Issue.1-3 , pp. 293-297
- Biedl, T.¹ Demaine, E.² Demaine, M.³ Lazard, S.⁴ Lubiw, A.⁵ O'Rourke, J.⁶ Robbins, S.⁷ Streinu, I.⁸ Toussaint, G.⁹ Whitesides, S.¹⁰

5
- 0032761917
- Locked and unlocked polygonal chains in 3D
- also Disc. Comp. Geom., vol.26, no.3, pp.269-281, 2001
- (1999) Proc. 10th ACM-SIAM Symposium on Discrete Algorithms , pp. 866-867
- Biedl, T.¹ Demaine, E.² Demaine, M.³ Lazard, S.⁴ Lubiw, A.⁵ O'Rourke, J.⁶ Overmars, M.⁷ Robbins, S.⁸ Streinu, I.⁹ Tousaint, G.¹⁰ Whitesides, S.¹¹

6
- 0002268787
- Polygonal chains cannot lock in 4D
- (1999) Proc. 11th Canadian Conference on Computational Geometry , pp. 5-8
- Cocan, R.¹ O'Rourke, J.²

7
- 0034514005
- Straightening polygonal arcs and convexifying polygonal cycles
- (2000) Proc. 41st IEEE Symposium on Foundations of Computer Science , pp. 432-442
- Connelly, R.¹ Demaine, E.² Rote, G.³

8
- 0004116989
- MIT press, Cmbridge, MA
- (1990) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³

9
- 0001607250
- Convexifying star-shaped polygons
- (1998) Proc. 10th Canadian Conference on Computational Geometry , pp. 2-3
- Everett, H.¹ Lazard, S.² Robbins, S.³ Schroeder, H.⁴ Whitesides, S.⁵

10
- 51249165461
- Reconfiguring closed polygonal chains in Euclidean d-space
- (1995) Discrete Comput. Geom. , vol.13 , pp. 123-140
- Lenhart, W.J.¹ Whitesides, S.H.²

11
- 84947770218
- Folding and unfolding in computational geometry
- (1999) Proc. Japan Conference on Discrete and Computational Geometry 1998, LNCS 1763 , pp. 258-266
- O'Rourke, J.¹

12
- 0003487647
- Springer-Verlag
- (1985) Computational Geometry: An Introduction
- Preparata, F.P.¹ Shamos, M.I.²

13
- 0034504512
- A combinatorial approach to planar non-colliding robot arm motion planning
- (2000) Proc. 41st IEEE Symposium on Foundation of Computer Science , pp. 443-453
- Streinu, I.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.