Results 91 to 100 of about 939,183 (156)
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions [PDF]
, 2003 We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1.
Damian, Mirela, O'Rourke, Joseph
core +2 more sources
The difficulty of folding self-folding origami
, 2017 Why is it difficult to refold a previously folded sheet of paper? We show that even crease patterns with only one designed folding motion inevitably contain an exponential number of `distractor' folding branches accessible from a bifurcation at the flat ...
Murugan, Arvind +2 more
core +2 more sources
Computational Geometry Column 35 [PDF]
SIGACT News, 30(2) Issue #111 (1999) 31-32, 1999 The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
arxiv
Computational Geometry Column 43 [PDF]
SIGACT News, 33(1) Issue 122, Mar. 2002, 58-60, 2002 The concept of pointed pseudo-triangulations is defined and a few of its applications described.
arxiv
Computational Geometry Column 44 [PDF]
arXiv, 2003 The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.
arxiv
Some Counterexamples for Compatible Triangulations
, 2016 We consider the conjecture by Aichholzer, Aurenhammer, Hurtado, and Krasser that any two points sets with the same cardinality and the same size convex hull can be triangulated in the "same" way, more precisely via \emph{compatible triangulations}.
Barnson, Cody +16 more
core
Labeled Interleaving Distance for Reeb Graphs
, 2023 Merge trees, contour trees, and Reeb graphs are graph-based topological descriptors that capture topological changes of (sub)level sets of scalar fields.
Lan, Fangfei, Parsa, Salman, Wang, Bei
core
Computational Geometry Column 45 [PDF]
arXiv, 2004 The algorithm of Edelsbrunner for surface reconstruction by ``wrapping'' a set of points in R^3 is described.
arxiv
Carnival of Samplings: Nets, Approximations, Relative and Sensitive [PDF]
arXiv, 2009 We survey several results known on sampling in computational geometry.
arxiv
Guarding and Searching Polyhedra [PDF]
arXiv, 2012 We tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and orthogonal polyhedra.
arxiv