This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
A common task at almost any computer interface is that of searchingfordocuments,whichGUIstypicallyrepresentwith icons. Oddly, little research has been done on the processes underl...
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introd...
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
We examine the suitability of RDF, RDF Schema (as simple ontology language), and RDF repository Sesame, for providing the backend to a prospective domain-specific web search tool, ...