Publication:4945520
From MaRDI portal
zbMath0948.68194MaRDI QIDQ4945520
Thomas C. Shermer, Subir Kumar Ghosh, Tetsuo Asano
Publication date: 13 November 2000
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Reconstructing Generalized Staircase Polygons with Uniform Step Length, Reconstructing Generalized Staircase Polygons with Uniform Step Length, Characterizing LR-visibility polygons and related problems, New variants of perfect non-crossing matchings, Diffuse reflection diameter in simple polygons, A new upper bound for the VC-dimension of visibility regions, An improved algorithm for reconstructing a simple polygon from its visibility angles, Watchman tours for polygons with holes, Point-set embeddings of plane \(3\)-trees, Long non-crossing configurations in the plane, Computing pseudotriangulations via branched coverings, New variants of perfect non-crossing matchings, The embracing Voronoi diagram and closest embracing number, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Segment endpoint visibility graphs are Hamiltonian, Optimal point-set embedding of wheel graphs and a sub-class of 3-trees, Compatible spanning trees, Computing the maximum clique in the visibility graph of a simple polygon, Visibility maps of segments and triangles in 3D, A linear time algorithm to remove winding of a simple polygon
