SCOPUS 정보 검색 플랫폼

Volumn 44, Issue 1, 2011, Pages 1-8

A note on the perimeter of fat objects

Author keywords

Fat objects; Fractals; Perimeter; Realistic inputs; Visibility

Indexed keywords

FAT OBJECTS; LINEAR FUNCTIONS; OBJECT O; PERIMETER; POSITIVE CONSTANT; REALISTIC INPUTS;

VISIBILITY;

FRACTALS;

EID: 77956226744 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/j.comgeo.2010.06.002 Document Type: Article

Times cited : (2)

References (11)

1
- 54249155222
- Guarding art galleries: The extra cost for sculptures is linear
- Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé, Guarding art galleries: The extra cost for sculptures is linear, in: Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), 2008, pp. 41-52.
- (2008) Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08) , pp. 41-52
- Louigi Addario-Berry, O.¹

2
- 84893382309
- Guarding fat polygons and triangulating guarded polygons
- Greg Aloupis, Prosenjit Bose, Vida Dujmović, Chris Gray, Stefan Langerman, Bettina Speckmann, Guarding fat polygons and triangulating guarded polygons, in: Proc. 20th Canadian Conference on Computational Geometry (CCCG'08), 2008, pp. 107-111.
- (2008) Proc. 20th Canadian Conference on Computational Geometry (CCCG'08) , pp. 107-111
- Greg Aloupis, P.¹

3
- 0037119070
- Walking around fat obstacles
- L. Paul Chew, Haggai David, Matthew J. Katz, and Klara Kedem Walking around fat obstacles Inform. Process. Lett. 83 3 2002 135 140
- (2002) Inform. Process. Lett. , vol.83 , Issue.3 , pp. 135-140
- Paul, C.L.¹ David, H.² Katz, M.J.³ Kedem, K.⁴

4
- 49249132575
- Improved bounds on the union complexity of fat objects
- Mark de Berg Improved bounds on the union complexity of fat objects Discrete Comput. Geom. 40 1 2008 127 140
- (2008) Discrete Comput. Geom. , vol.40 , Issue.1 , pp. 127-140
- De Berg, M.¹

5
- 0141888135
- Realistic input models for geometric algorithms
- Mark de Berg, Matthew Katz, Frank van der Stappen, and Jules Vleugels Realistic input models for geometric algorithms Algorithmica 34 2002 81 97
- (2002) Algorithmica , vol.34 , pp. 81-97
- De Berg, M.¹ Katz, M.² Van Der Stappen, F.³ Vleugels, J.⁴

6
- 24344452560
- The complexity of the union of (α,β)-covered objects
- Alon Efrat The complexity of the union of (α, β)-covered objects SIAM J. Comput. 34 2005 775 787
- (2005) SIAM J. Comput. , vol.34 , pp. 775-787
- Efrat, A.¹

7
- 7544245726
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Klara Kedem, Ron Livne, Janos Pach, and Micha Sharir On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles Discrete Comput. Geom. 1 1986 59 71
- (1986) Discrete Comput. Geom. , vol.1 , pp. 59-71
- Kedem, K.¹ Livne, R.² Pach, J.³ Sharir, M.⁴

8
- 33644759561
- Guarding galleries with no nooks
- David Kirkpatrick, Guarding galleries with no nooks, in: Proc. of the 12th Canadian Conference on Computational Geometry (CCCG'00), 2000, pp. 43-46.
- (2000) Proc. of the 12th Canadian Conference on Computational Geometry (CCCG'00) , pp. 43-46
- Kirkpatrick, D.¹

9
- 0028378786
- Fat triangles determine linearly many holes
- Jiři Matoušek, Janos Pach, Micha Sharir, Shmuel Sifrony, and Emo Welzl Fat triangles determine linearly many holes SIAM J. Comput. 23 1994 154 169
- (1994) SIAM J. Comput. , vol.23 , pp. 154-169
- Matoušek, J.Ř.¹ Pach, J.² Sharir, M.³ Sifrony, S.⁴ Welzl, E.⁵

10
- 0032438217
- Guarding galleries where no point sees a small area
- Pavel Valtr Guarding galleries where no point sees a small area Israel J. Math. 104 1998 1 16
- (1998) Israel J. Math. , vol.104 , pp. 1-16
- Valtr, P.¹

11
- 0001614195
- Sur une courbe continue sans tangente, obtenue par une construction géométrique élémentaire
- Helge von Koch Sur une courbe continue sans tangente, obtenue par une construction géométrique élémentaire Arch. Mat. Astron. Fys. 1 1904 681 702
- (1904) Arch. Mat. Astron. Fys. , vol.1 , pp. 681-702
- Von Koch, H.¹

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