Sciweavers

556 search results - page 57 / 112
» Checking Interval Properties of Computations
Sort
View
ECCV
2002
Springer
16 years 6 months ago
A Rectilinearity Measurement for Polygons
In this paper we define a function R(P) which is defined for any polygon P and which maps a given polygon P into a number from the interval (0, 1]. The number R(P) can be used as a...
Jovisa D. Zunic, Paul L. Rosin
VISUALIZATION
2003
IEEE
15 years 9 months ago
Counting Cases in Marching Cubes: Toward a Generic Algorithm for Producing Substitopes
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
David C. Banks, Stephen A. Linton
POPL
2010
ACM
16 years 1 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
SGP
2004
15 years 6 months ago
Persistence Barcodes for Shapes
In this paper, we initiate a study of shape description and classification via the application of persistent homology to tangential constructions on geometric objects. Our techniq...
Gunnar Carlsson, Afra Zomorodian, Anne D. Collins,...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 4 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo