A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
We present a new intuitive UI, which we call cross-boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our sy...
This paper presents a new interaction metaphor we have termed “god-like interaction”. This is a metaphor for improved communication of situational and navigational information...
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...