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

메뉴 건너뛰기

Discrete and Computational Geometry

Volumn 31, Issue 2, 2004, Pages 207-227

Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles

(3) Dumitrescu, Adrian a Mitchell, Joseph S B b Sharir, Micha c,d

a University of Wisconsin Milwaukee (United States)

b Stony Brook University (United States)

c TEL AVIV UNIVERSITY (Israel)

d NEW YORK UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1642338460 PISSN: 01795376 EISSN: None Source Type: Journal
DOI: 10.1007/s00454-003-0729-3 Document Type: Article

Times cited : (26)

References (15)

1
- 0001099872
- On the optimal binary plane partition for sets of isothetic rectangles
- F. d'Amore and P. G. Franciosa, On the optimal binary plane partition for sets of isothetic rectangles, Inform. Process. Lett. 44 (1992), 255-259.
- (1992) Inform. Process. Lett. , vol.44 , pp. 255-259
- D'Amore, F.¹ Franciosa, P.G.²

2
- 0000126187
- New results on binary space partitions in the plane
- M. de Berg, M. de Groot, and M. Overmars, New results on binary space partitions in the plane, Comput. Geom. Theory Appl. 8 (1997), 317-333.
- (1997) Comput. Geom. Theory Appl. , vol.8 , pp. 317-333
- De Berg, M.¹ De Groot, M.² Overmars, M.³

3
- 0003501338
- Perfect binary space partitions
- M. de Berg, M. de Groot, and M. Overmars, Perfect binary space partitions, Comput. Geom. Theory Appl. 7 (1997), 81-91.
- (1997) Comput. Geom. Theory Appl. , vol.7 , pp. 81-91
- De Berg, M.¹ De Groot, M.² Overmars, M.³

4
- 0036487459
- On the exact size of the binary space partitioning of sets of isothetic rectangles with applications
- P. Berman, B. DasGupta, and S. Muthukrishnan, On the exact size of the binary space partitioning of sets of isothetic rectangles with applications, SIAM J. Discrete Math. 15(2) (2002), 252-267.
- (2002) SIAM J. Discrete Math. , vol.15 , Issue.2 , pp. 252-267
- Berman, P.¹ DasGupta, B.² Muthukrishnan, S.³

5
- 0037866149
- Efficient approximation algorithms for tiling and packing problems with rectangles
- P. Berman, B. DasGupta, S. Muthukrishnan, and S. Ramaswami, Efficient approximation algorithms for tiling and packing problems with rectangles, J. Algorithms 41 (2001), 443- 470.
- (2001) J. Algorithms , vol.41 , pp. 443-470
- Berman, P.¹ DasGupta, B.² Muthukrishnan, S.³ Ramaswami, S.⁴

6
- 85034219450
- Near real-time shadow generation using BSP trees
- S. Chin and S. Feiner, Near real-time shadow generation using BSP trees, Comput. Graph. 23 (1989), 99-106.
- (1989) Comput. Graph. , vol.23 , pp. 99-106
- Chin, S.¹ Feiner, S.²

7
- 0000647688
- A survey of object-space hidden surface removal
- S. E. Dorwald. A survey of object-space hidden surface removal, Internat. J. Comput. Geom. Appl. 4 (1994), 325-362.
- (1994) Internat. J. Comput. Geom. Appl. , vol.4 , pp. 325-362
- Dorwald, S.E.¹

8
- 0019033556
- On visible surface generation by a priori tree structures
- H. Fuchs, Z. M. Kedem, and B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14(1980), 124-133.
- (1980) Comput. Graph. , vol.14 , pp. 124-133
- Fuchs, H.¹ Kedem, Z.M.² Naylor, B.³

9
- 33947329925
- Efficient binary space partitions for hidden- Surface removal and solid modeling
- M. S. Paterson and F. F. Yao, Efficient binary space partitions for hidden- surface removal and solid modeling, Discrete Comput. Geom. 5 (1990), 485-503.
- (1990) Discrete Comput. Geom. , vol.5 , pp. 485-503
- Paterson, M.S.¹ Yao, F.F.²

10
- 38249015964
- Optimal binary space partitions for orthogonal objects
- M. S. Paterson and F. F. Yao, Optimal binary space partitions for orthogonal objects, J. Algorithms 13 (1992), 99-113.
- (1992) J. Algorithms , vol.13 , pp. 99-113
- Paterson, M.S.¹ Yao, F.F.²

11
- 0037633580
- A note on binary plane partitions
- C. D. Tóth, A note on binary plane partitions, Discrete Comput. Geom. 30(1) (2003), 3-16.
- (2003) Discrete Comput. Geom. , vol.30 , Issue.1 , pp. 3-16
- Tóth, C.D.¹

12
- 0037610118
- Binary space partitions for line segments with a limited number of directions
- C. D. Tóth, Binary space partitions for line segments with a limited number of directions, SIAMJ. Comput. 32(2) (2003), 307-325.
- (2003) SIAM J. Comput. , vol.32 , Issue.2 , pp. 307-325
- Tóth, C.D.¹

13
- 0023380251
- Set operations on polyhedra using binary space partitioning trees
- W. C. Thibault and B. F. Naylor, Set operations on polyhedra using binary space partitioning trees, Comput. Graph. 21(4) (1987), 153-162 (Proc. SIGGRAPH '87).
- (1987) Comput. Graph. , vol.21 , Issue.4 , pp. 153-162
- Thibault, W.C.¹ Naylor, B.F.²

14
- 0023380251
- W. C. Thibault and B. F. Naylor, Set operations on polyhedra using binary space partitioning trees, Comput. Graph. 21(4) (1987), 153-162 (Proc. SIGGRAPH '87).
- Proc. SIGGRAPH '87

15
- 0037825138
- Brep-Index: A multidimensional space partitioning tree
- G. Vaněček Jr., Brep-Index: a multidimensional space partitioning tree, Internat. J. Comput. Geom. Appl. 1(3) (1991), 243-261.
- (1991) Internat. J. Comput. Geom. Appl. , vol.1 , Issue.3 , pp. 243-261
- Vaněček Jr., G.¹

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