메뉴 건너뛰기




Volumn 38, Issue 1, 2008, Pages 429-447

Binary space partitions for axis-aligned fat rectangles

Author keywords

Axisa aligned rectangles; Binary space partition; Convex partition; Fat objects

Indexed keywords

AXISA-ALIGNED RECTANGLES; BINARY SPACE PARTITION; BINARY SPACE PARTITIONS; CONVEX PARTITION; FAT OBJECTS;

EID: 55249121650     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/06065934X     Document Type: Article
Times cited : (16)

References (25)
  • 2
    • 0010308870 scopus 로고    scopus 로고
    • Self-customized BSP trees for collision detection
    • S. AR, B. CHAZELLE, AND A. TAL, Self-customized BSP trees for collision detection, Comput. Geom., 15 (2000), pp. 91-102.
    • (2000) Comput. Geom , vol.15 , pp. 91-102
    • AR, S.1    CHAZELLE, B.2    TAL, A.3
  • 3
    • 0036732077 scopus 로고    scopus 로고
    • Deferred, self-organizing BSP trees
    • S. AR, G. MONTAG, AND A. TAL, Deferred, self-organizing BSP trees, Comput. Graph. Forum, 21 (2002), pp. 269-278.
    • (2002) Comput. Graph. Forum , vol.21 , pp. 269-278
    • AR, S.1    MONTAG, G.2    TAL, A.3
  • 4
    • 0037202495 scopus 로고    scopus 로고
    • Binary space partitions for axis-parallel line segments: Size-height tradeoffs
    • S. ARYA, Binary space partitions for axis-parallel line segments: Size-height tradeoffs, Inform. Process. Lett., 84 (2002), pp. 201-206.
    • (2002) Inform. Process. Lett , vol.84 , pp. 201-206
    • ARYA, S.1
  • 5
    • 34250182684 scopus 로고    scopus 로고
    • Optimal expected-case planar point location
    • S. ARYA, T. MALAMATOS, D. M. MOUNT, AND K. C. WONG, Optimal expected-case planar point location, SIAM J. Comput., 37 (2007), pp. 584-610.
    • (2007) SIAM J. Comput , vol.37 , pp. 584-610
    • ARYA, S.1    MALAMATOS, T.2    MOUNT, D.M.3    WONG, K.C.4
  • 7
    • 0004009921 scopus 로고
    • Motion Planning Using Binary Space Partitions
    • Technical report Inf/src/93-25, Utrecht University, Utrecht, The Netherlands
    • C. BALLIEUX, Motion Planning Using Binary Space Partitions, Technical report Inf/src/93-25, Utrecht University, Utrecht, The Netherlands, 1993.
    • (1993)
    • BALLIEUX, C.1
  • 8
    • 85034219450 scopus 로고
    • Near real-time shadow generation using BSP trees
    • N. CHIN AND S. FEINER, Near real-time shadow generation using BSP trees, ACM SIGGRAPH Computer Graphics, 23 (1989), pp. 99-106.
    • (1989) ACM SIGGRAPH Computer Graphics , vol.23 , pp. 99-106
    • CHIN, N.1    FEINER, S.2
  • 9
    • 0002635388 scopus 로고
    • Fast object-precision shadow generation for area light sources using BSP trees
    • N. CHIN AND S. FEINER, Fast object-precision shadow generation for area light sources using BSP trees, Comput. Graph., 25 (1992), pp. 21-30.
    • (1992) Comput. Graph , vol.25 , pp. 21-30
    • CHIN, N.1    FEINER, S.2
  • 10
    • 0006042934 scopus 로고    scopus 로고
    • Linear size binary space partitions for uncluttered, scenes
    • M. DE BERG, Linear size binary space partitions for uncluttered, scenes, Algorithmica, 28 (2000), pp. 353-366.
    • (2000) Algorithmica , vol.28 , pp. 353-366
    • DE BERG, M.1
  • 11
    • 84867937602 scopus 로고    scopus 로고
    • M. DE BERG, H. DAVID, M. KATZ, M. OVERMARS, A. F. VAN DER STAPPEN, AND J. VLEUGELS, Guarding scenes against invasive hypercubes, Comput. Geom., 26 (2003), pp. 99-117.
    • M. DE BERG, H. DAVID, M. KATZ, M. OVERMARS, A. F. VAN DER STAPPEN, AND J. VLEUGELS, Guarding scenes against invasive hypercubes, Comput. Geom., 26 (2003), pp. 99-117.
  • 12
    • 0000126187 scopus 로고    scopus 로고
    • 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., 8 (1997), pp. 317-333.
    • (1997) Comput. Geom , vol.8 , pp. 317-333
    • DE BERG, M.1    DE GROOT, M.2    OVERMARS, M.3
  • 13
    • 84867971575 scopus 로고    scopus 로고
    • Approximate range searching using binary space partitions
    • M. DE BERG AND M. STREPPEL, Approximate range searching using binary space partitions, Comput. Geom., 33 (2006), pp. 139-151.
    • (2006) Comput. Geom , vol.33 , pp. 139-151
    • DE BERG, M.1    STREPPEL, M.2
  • 15
    • 1642338460 scopus 로고    scopus 로고
    • Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
    • A. DUMITRESCU, J. S. B. MITCHELL, AND M. SHARIR, Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles, Discrete Comput. Geom., 31 (2004), pp. 207-227.
    • (2004) Discrete Comput. Geom , vol.31 , pp. 207-227
    • DUMITRESCU, A.1    MITCHELL, J.S.B.2    SHARIR, M.3
  • 16
    • 0019033556 scopus 로고
    • 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), pp. 124-133.
    • (1980) Comput. Graph , vol.14 , pp. 124-133
    • FUCHS, H.1    KEDEM, Z.M.2    NAYLOR, B.3
  • 17
    • 29344451452 scopus 로고    scopus 로고
    • Binary space partitions of orthogonal subdivisions
    • J. HERSHBERGER, S. SURI, AND Cs. D. TÓTH, Binary space partitions of orthogonal subdivisions, SIAM J. Comput., 34 (2005), pp. 1380-1397.
    • (2005) SIAM J. Comput , vol.34 , pp. 1380-1397
    • HERSHBERGER, J.1    SURI, S.2    TÓTH, C.D.3
  • 19
    • 0027794139 scopus 로고
    • Constructing good partitioning trees
    • Canadian Human-Computer Communications Society, Toronto
    • B. NAYLOR, Constructing good partitioning trees, in Proceedings of Graphics Interface, 1993, Canadian Human-Computer Communications Society, Toronto, 1993, pp. 181-191.
    • (1993) Proceedings of Graphics Interface , pp. 181-191
    • NAYLOR, B.1
  • 20
    • 33947329925 scopus 로고
    • 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), pp. 485-503.
    • (1990) Discrete Comput. Geom , vol.5 , pp. 485-503
    • PATERSON, M.S.1    YAO, F.F.2
  • 21
    • 38249015964 scopus 로고
    • 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), pp. 99-113.
    • (1992) J. Algorithms , vol.13 , pp. 99-113
    • PATERSON, M.S.1    YAO, F.F.2
  • 22
    • 0003932802 scopus 로고
    • Study for Applying Computer-generated Images to Visual Simulation
    • Technical report AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, San Antonio, TX
    • R. A. SCHUMACKER, R. BRAND, M. GILLILAND, AND W. SHARP, Study for Applying Computer-generated Images to Visual Simulation, Technical report AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory, San Antonio, TX, 1969.
    • (1969)
    • SCHUMACKER, R.A.1    BRAND, R.2    GILLILAND, M.3    SHARP, W.4
  • 23
    • 0023380251 scopus 로고
    • 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 (1987), pp. 153-162.
    • (1987) Comput. Graph , vol.21 , pp. 153-162
    • THIBAULT, W.C.1    NAYLOR, B.F.2
  • 24
    • 0037633580 scopus 로고    scopus 로고
    • A note on binary plane partitions
    • Cs. D. TÓTH, A note on binary plane partitions, Discrete Comput. Geom., 30 (2003), pp. 3-16.
    • (2003) Discrete Comput. Geom , vol.30 , pp. 3-16
    • TÓTH, C.D.1
  • 25
    • 0037610118 scopus 로고    scopus 로고
    • Binary space partitions for line segments with a limited number of directions
    • Cs. D. TÓTH, Binary space partitions for line segments with a limited number of directions, SIAM J. Comput., 32 (2003), pp. 307-325.
    • (2003) SIAM J. Comput , vol.32 , pp. 307-325
    • TÓTH, C.D.1


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