메뉴 건너뛰기




Volumn 39, Issue 7, 2010, Pages 2990-3000

Preprocessing imprecise points and splitting triangulations

Author keywords

Computational geometry; Data imprecision; Preprocessing; Triangulations

Indexed keywords

DATA IMPRECISION; DISJOINT REGIONS; LINEAR TIME; PREPROCESS; PREPROCESSING;

EID: 77956036201     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090753620     Document Type: Article
Times cited : (24)

References (23)
  • 1
    • 0033311795 scopus 로고    scopus 로고
    • Structural tolerance and delaunay triangulation
    • M. ABELLANAS, F. HURTADO, AND P. A. RAMOS, Structural tolerance and Delaunay triangulation, Inform. Process. Lett., 71 (1999), pp. 221-227.
    • (1999) Inform. Process. Lett. , vol.71 , pp. 221-227
    • Abellanas, M.1    Hurtado, F.2    Ramos, P.A.3
  • 3
    • 84867959708 scopus 로고    scopus 로고
    • Three problems about simple polygons
    • T. M. CHAN, Three problems about simple polygons, Comput. Geo., 35 (2006), pp. 209-217.
    • (2006) Comput. Geo. , vol.35 , pp. 209-217
    • Chan, T.M.1
  • 6
    • 0032107935 scopus 로고    scopus 로고
    • Finding the constrained delaunay triangulation and constrained voronoi diagram of a simple polygon in linear time
    • F. CHIN AND C. A. WANG, Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time, SIAM J. Comput., 28 (1998), pp. 471-486.
    • (1998) SIAM J. Comput. , vol.28 , pp. 471-486
    • Chin, F.1    Wang, C.A.2
  • 7
    • 0141913348 scopus 로고
    • On computing voronoi diagrams for sorted point sets
    • H. DJIDJEV AND A. LINGAS, On computing Voronoi diagrams for sorted point sets, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 327-337.
    • (1995) Internat. J. Comput. Geom. Appl. , vol.5 , pp. 327-337
    • Djidjev, H.1    Lingas, A.2
  • 8
    • 38249016352 scopus 로고
    • Covering convex sets with nonoverlapping polygons
    • H. EDELSBRUNNER, A. D. ROBISON, AND X. SHEN, Covering convex sets with nonoverlapping polygons, Discrete Math., 81 (1990), pp. 153-164.
    • (1990) Discrete Math. , vol.81 , pp. 153-164
    • Edelsbrunner, H.1    Robison, A.D.2    Shen, X.3
  • 9
    • 0041417874 scopus 로고    scopus 로고
    • Correct delaunay triangulation in the presence of inexact inputs and arithmetic
    • J. S. ELY AND A. P. LECLERC, Correct Delaunay triangulation in the presence of inexact inputs and arithmetic, Reliab. Comput., 6 (2000), pp. 23-38.
    • (2000) Reliab. Comput. , vol.6 , pp. 23-38
    • Ely, J.S.1    Leclerc, A.P.2
  • 10
    • 0027606684 scopus 로고
    • Constructing strongly convex approximate hulls with inaccurate primitives
    • L. J. GUIBAS, D. SALESIN, AND J. STOLFI, Constructing strongly convex approximate hulls with inaccurate primitives, Algorithmica, 9 (1993), pp. 534-560.
    • (1993) Algorithmica , vol.9 , pp. 534-560
    • Guibas, L.J.1    Salesin, D.2    Stolfi, J.3
  • 11
    • 55149087469 scopus 로고    scopus 로고
    • Triangulating input-constrained planar point sets
    • M. HELD AND J. S. B. MITCHELL, Triangulating input-constrained planar point sets, Inform. Process. Lett., 109 (2008), pp. 54-56.
    • (2008) Inform. Process. Lett. , vol.109 , pp. 54-56
    • Held, M.1    Mitchell, J.S.B.2
  • 15
    • 18944376965 scopus 로고    scopus 로고
    • Computability of partial delaunay triangulation and voronoi diagram
    • A. A. KHANBAN, A. EDALAT, AND A. LIEUTIER, Computability of partial Delaunay triangulation and Voronoi diagram, Electron. Notes Theor. Comput. Sci., 66 (2002), pp. 91-103.
    • (2002) Electron. Notes Theor. Comput. Sci. , vol.66 , pp. 91-103
    • Khanban, A.A.1    Edalat, A.2    Lieutier, A.3
  • 16
    • 84867958383 scopus 로고    scopus 로고
    • Delaunay triangulations of imprecise points in linear time after preprocessing
    • M. LOFFLER AND J. SNOEYINK, Delaunay triangulations of imprecise points in linear time after preprocessing, Comput. Geom., 43 (2010), pp. 234-242.
    • (2010) Comput. Geom. , vol.43 , pp. 234-242
    • Loffler, M.1    Snoeyink, J.2
  • 17
    • 74849124973 scopus 로고    scopus 로고
    • Largest and smallest convex hulls for imprecise points
    • M. LÖFFLER AND M. VAN KREVELD, Largest and smallest convex hulls for imprecise points, Algorithmica, 56 (2010), pp. 235-269.
    • (2010) Algorithmica , vol.56 , pp. 235-269
    • Löffler, M.1    Van Kreveld, M.2
  • 18
    • 73549120398 scopus 로고    scopus 로고
    • Largest bounding box, smallest diameter, and related problems on imprecise points
    • M. LÖFFLER AND M. VAN KREVELD, Largest bounding box, smallest diameter, and related problems on imprecise points, Comput. Geom., 43 (2010), pp. 419-433.
    • (2010) Comput. Geom. , vol.43 , pp. 419-433
    • Löffler, M.1    Van Kreveld, M.2
  • 19
    • 0003586083 scopus 로고    scopus 로고
    • On polygonal covers
    • B. Chazelle, J. Goodman, and R. Pollack, eds., Contemp. Math. AMS, Providence, RI
    • M. POCCHIOLA AND G. VEGTER, On polygonal covers, in Advances in Discrete and Computational Geometry, B. Chazelle, J. Goodman, and R. Pollack, eds., Contemp. Math. 223, AMS, Providence, RI, 1999, pp. 257-267.
    • (1999) Advances in Discrete and Computational Geometry , vol.223 , pp. 257-267
    • Pocchiola, M.1    Vegter, G.2
  • 20
    • 0032194114 scopus 로고    scopus 로고
    • Fuzzy geometry: An updated overview
    • A. ROSENFELD, Fuzzy geometry: An updated overview, Inform. Sci., 110 (1998), pp. 127-133.
    • (1998) Inform. Sci. , vol.110 , pp. 127-133
    • Rosenfeld, A.1
  • 21
    • 35248859666 scopus 로고    scopus 로고
    • On constrained minimum pseudotriangulations
    • Lecture Notes in Comput. Sci. Springer, Berlin
    • G. ROTE, C. A. WANG, L. WANG, AND Y. XU, On constrained minimum pseudotriangulations, in Computing and Combinatorics, Lecture Notes in Comput. Sci. 2697, Springer, Berlin, 2003, pp. 445-454.
    • (2003) Computing and Combinatorics , vol.2697 , pp. 445-454
    • Rote, G.1    Wang, C.A.2    Wang, L.3    Xu, Y.4
  • 22
    • 30644462875 scopus 로고    scopus 로고
    • Pseudo-triangulations, rigidity and motion planning
    • I. STREINU, Pseudo-triangulations, rigidity and motion planning, Discrete Comput. Geom., 34 (2005), pp. 587-635.
    • (2005) Discrete Comput. Geom. , vol.34 , pp. 587-635
    • Streinu, I.1


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