The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
The University of Portland Office of Computer and Telecommunication Services (CTS) created an Intranet web site for the University community during the summer of 1998. In the summ...
This paper presents a new architecture of a database management system intended to be used together with existing graphics software. In the first place, a system with this archite...
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
This paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. Our method lends itself for an interactive modeling system as the ...