COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
toris-)Rips complex of a discrete point-set P is an abstract simplicial complex in
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
COMPGEOM
2008
ACM
13 years 11 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...