SCOPUS 정보 검색 플랫폼

Computational Geometry: Theory and Applications

Volumn 43, Issue 3, 2010, Pages 243-250

A (slightly) faster algorithm for Klee's measure problem

(1) Chan, Timothy M a

a UNIVERSITY OF WATERLOO (Canada)

Author keywords

Boxes; Data structures; Union of geometric objects; Volume

Indexed keywords

EID: 84867922154 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/j.comgeo.2009.01.007 Document Type: Conference Paper

Times cited : (46)

References (30)

1
- 35348815511
- Computing the volume of the union of cubes
- P.K. Agarwal, H. Kaplan, M. Sharir, Computing the volume of the union of cubes, in: Proc. 23rd ACM Sympos. Comput. Geom., 2007, pp. 294-301
- (2007) Proc. 23rd ACM Sympos. Comput. Geom. , pp. 294-301
- Agarwal, P.K.¹ Kaplan, H.² Sharir, M.³

2
- 40649095740
- Subquadratic algorithms for 3SUM
- I. Baran, E.D. Demaine, and M. Pǎtraşcu Subquadratic algorithms for 3SUM Algorithmica 50 2008 584 596
- (2008) Algorithmica , vol.50 , pp. 584-596
- Baran, I.¹ Demaine, E.D.² Pǎtraşcu, M.³

3
- 0020879158
- Lower bounds for algebraic computation trees
- M. Ben-Or, Lower bounds for algebraic computation trees, in: Proc. 15th ACM Sympos. Theory Comput., 1983, pp. 80-86
- (1983) Proc. 15th ACM Sympos. Theory Comput. , pp. 80-86
- Ben-Or, M.¹

4
- 0003428927
- unpublished manuscript
- J.L. Bentley, Algorithms for Klee's rectangle problem, unpublished manuscript, 1977
- (1977) Algorithms for Klee's Rectangle Problem
- Bentley, J.L.¹

5
- 0038897223
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- J.-D. Boissonnat, M. Sharir, B. Tagansky, and M. Yvinec Voronoi diagrams in higher dimensions under certain polyhedral distance functions Discrete Comput. Geom. 19 1998 473 484
- (1998) Discrete Comput. Geom. , vol.19 , pp. 473-484
- Boissonnat, J.-D.¹ Sharir, M.² Tagansky, B.³ Yvinec, M.⁴

6
- 35448954441
- On the parametrized complexity of d-dimensional point set pattern matching
- S. Cabello, P. Giannopoulos, and C. Knauer On the parametrized complexity of d-dimensional point set pattern matching Inform. Process. Lett. 105 2008 73 77
- (2008) Inform. Process. Lett. , vol.105 , pp. 73-77
- Cabello, S.¹ Giannopoulos, P.² Knauer, C.³

7
- 57349128630
- Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
- S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, G. Rote, Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension, in: Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, 2008, pp. 836-843
- (2008) Proc. 19th ACM-SIAM Sympos. Discrete Algorithms , pp. 836-843
- Cabello, S.¹ Giannopoulos, P.² Knauer, C.³ Marx, D.⁴ Rote, G.⁵

8
- 0033461748
- Geometric applications of a randomized optimization technique
- T.M. Chan Geometric applications of a randomized optimization technique Discrete Comput. Geom. 22 1999 547 567
- (1999) Discrete Comput. Geom. , vol.22 , pp. 547-567
- Chan, T.M.¹

9
- 0038299454
- Semi-online maintenance of geometric optima and measures
- T.M. Chan Semi-online maintenance of geometric optima and measures SIAM J. Comput. 32 2003 700 716
- (2003) SIAM J. Comput. , vol.32 , pp. 700-716
- Chan, T.M.¹

10
- 35448979108
- More algorithms for all-pairs shortest paths in weighted graphs
- T.M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, in: Proc. 39th ACM Sympos. Theory Comput., 2007, pp. 590-598
- (2007) Proc. 39th ACM Sympos. Theory Comput. , pp. 590-598
- Chan, T.M.¹

11
- 0033478042
- Geometric pattern matching in d-dimensional space
- L.P. Chew, D. Dor, A. Efrat, and K. Kedem Geometric pattern matching in d-dimensional space Discrete Comput. Geom. 21 1999 257 274
- (1999) Discrete Comput. Geom. , vol.21 , pp. 257-274
- Chew, L.P.¹ Dor, D.² Efrat, A.³ Kedem, K.⁴

12
- 0001275216
- Static and dynamic algorithms for k-point clustering problems
- A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid Static and dynamic algorithms for k-point clustering problems J. Algorithms 19 1995 474 503
- (1995) J. Algorithms , vol.19 , pp. 474-503
- Datta, A.¹ Lenhof, H.-P.² Schwarz, C.³ Smid, M.⁴

13
- 85031913950
- Optimal algorithms for list indexing and subset rank
- Lect. Notes Comput. Sci. Springer-Verlag
- P.F. Dietz Optimal algorithms for list indexing and subset rank Proc. 1st Workshop Algorithms Data Struct. Lect. Notes Comput. Sci. vol. 382 1989 Springer-Verlag 39 46
- (1989) Proc. 1st Workshop Algorithms Data Struct. , vol.382 , pp. 39-46
- Dietz, P.F.¹

14
- 0030264248
- Computing the discrepancy with applications to supersampling patterns
- D.P. Dobkin, D. Eppstein, and D.P. Mitchell Computing the discrepancy with applications to supersampling patterns ACM Trans. Graph. 15 1996 354 376
- (1996) ACM Trans. Graph. , vol.15 , pp. 354-376
- Dobkin, D.P.¹ Eppstein, D.² Mitchell, D.P.³

15
- 1642338460
- 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 207 227
- (2004) Discrete Comput. Geom. , vol.31 , pp. 207-227
- Dumitrescu, A.¹ Mitchell, J.S.B.² Sharir, M.³

16
- 51249161526
- Iterated nearest neighbors and finding minimal polytopes
- D. Eppstein, and J. Erickson Iterated nearest neighbors and finding minimal polytopes Discrete Comput. Geom. 11 1994 321 350
- (1994) Discrete Comput. Geom. , vol.11 , pp. 321-350
- Eppstein, D.¹ Erickson, J.²

17
- 65549164282
- Internet packet filter management and rectangle geometry
- D. Eppstein, S. Muthukrishnan, Internet packet filter management and rectangle geometry, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 827-835
- (2001) Proc. 12th ACM-SIAM Sympos. Discrete Algorithms , pp. 827-835
- Eppstein, D.¹ Muthukrishnan, S.²

18
- 0037749504
- J. Erickson Klee's measure problem http://compgeom.cs.uiuc.edu/~jeffe/ open/klee.html 1998
- (1998) Klee's Measure Problem
- Erickson, J.¹

19
- 0035895138
- Lower bounds for dynamic algebraic problems
- G.S. Frandsen, J.P. Hansen, and P.B. Miltersen Lower bounds for dynamic algebraic problems Inf. Comput. 171 2001 333 349
- (2001) Inf. Comput. , vol.171 , pp. 333-349
- Frandsen, G.S.¹ Hansen, J.P.² Miltersen, P.B.³

20
- 0017995834
- bi ]
- bi ] Commun. ACM 21 1978 540 544
- (1978) Commun. ACM , vol.21 , pp. 540-544
- Fredman, M.L.¹ Weide, B.²

21
- 0038376559
- Efficient algorithms for shared camera control
- S. Har-Peled, V. Koltun, D. Song, K.Y. Goldberg, Efficient algorithms for shared camera control, in: Proc. 19th ACM Sympos. Comput. Geom., 2003, pp. 68-77
- (2003) Proc. 19th ACM Sympos. Comput. Geom. , pp. 68-77
- Har-Peled, S.¹ Koltun, V.² Song, D.³ Goldberg, K.Y.⁴

22
- 84969135590
- Counting colors in boxes
- H. Kaplan, N. Rubin, M. Sharir, E. Verbin, Counting colors in boxes, in: Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 2007, pp. 785-794
- (2007) Proc. 18th ACM-SIAM Sympos. Discrete Algorithms , pp. 785-794
- Kaplan, H.¹ Rubin, N.² Sharir, M.³ Verbin, E.⁴

23
- 0040738477
- bi ] be computed in less than O (nlogn) steps?
- bi ] be computed in less than O (nlogn) steps? Amer. Math. Monthly 84 1977 284 285
- (1977) Amer. Math. Monthly , vol.84 , pp. 284-285
- Klee, V.¹

24
- 0009819641
- The measure problem for rectangular ranges in d-space
- J. van Leeuwen, and D. Wood The measure problem for rectangular ranges in d-space J. Algorithms 2 1981 282 300
- (1981) J. Algorithms , vol.2 , pp. 282-300
- Van Leeuwen, J.¹ Wood, D.²

25
- 21144462806
- Efficient partition trees
- J. Matoušek Efficient partition trees Discrete Comput. Geom. 8 1992 315 334
- (1992) Discrete Comput. Geom. , vol.8 , pp. 315-334
- Matoušek, J.¹

26
- 0001456187
- Reporting points in halfspaces
- J. Matoušek Reporting points in halfspaces Comput. Geom. Theory Appl. 2 1992 169 186
- (1992) Comput. Geom. Theory Appl. , vol.2 , pp. 169-186
- Matoušek, J.¹

27
- 51249161633
- Range searching with efficient hierarchical cuttings
- J. Matoušek Range searching with efficient hierarchical cuttings Discrete Comput. Geom. 10 1993 157 182
- (1993) Discrete Comput. Geom. , vol.10 , pp. 157-182
- Matoušek, J.¹

28
- 0010806455
- On the complexity of the subgraph problem
- J. Nesetril, and S. Poljak On the complexity of the subgraph problem Comment. Math. Univ. Carol. 26 1985 415 419
- (1985) Comment. Math. Univ. Carol. , vol.26 , pp. 415-419
- Nesetril, J.¹ Poljak, S.²

29
- 0026406169
- New upper bounds in Klee's measure problem
- M. Overmars, and C.-K. Yap New upper bounds in Klee's measure problem SIAM J. Comput. 20 1991 1034 1045
- (1991) SIAM J. Comput. , vol.20 , pp. 1034-1045
- Overmars, M.¹ Yap, C.-K.²

30
- 0013362370
- On dynamic algorithms for algebraic problems
- J.H. Reif, and S.R. Tate On dynamic algorithms for algebraic problems J. Algorithms 22 1997 347 371
- (1997) J. Algorithms , vol.22 , pp. 347-371
- Reif, J.H.¹ Tate, S.R.²

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