Patents by Inventor DAVID EPPSTEIN

DAVID EPPSTEIN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8681145
    Abstract: A method for automatically transferring attributes between computer-generated models. The method includes storing in memory first and second models represented by polygonal meshes and storing a set of attributes for the first model. A processor operates or runs a compressed graph generator to process the first and second models to generate first and second compressed graphs that are compressed versions of the models. The method includes comparing topological connectivity of the first and second compressed graphs. When the connectivity is similar, the method includes transferring at least a portion of the attributes from the first model to the second model. The compressed graphs may be motorcycle graphs, skeleton graphs, or other forms of compressed graphs. The method includes determining a pair of vertices in the first compressed graph that match vertices in the second compressed graph for use as starting locations in comparing topological connectivity of the compressed graphs.
    Type: Grant
    Filed: March 20, 2009
    Date of Patent: March 25, 2014
    Assignee: Disney Enterprises, Inc.
    Inventors: Rasmus P. Tamstorf, Michael T. Goodrich, David Eppstein
  • Publication number: 20100238166
    Abstract: A method for automatically transferring attributes between computer-generated models. The method includes storing in memory first and second models represented by polygonal meshes and storing a set of attributes for the first model. A processor operates or runs a compressed graph generator to process the first and second models to generate first and second compressed graphs that are compressed versions of the models. The method includes comparing topological connectivity of the first and second compressed graphs. When the connectivity is similar, the method includes transferring at least a portion of the attributes from the first model to the second model. The compressed graphs may be motorcycle graphs, skeleton graphs, or other forms of compressed graphs. The method includes determining a pair of vertices in the first compressed graph that match vertices in the second compressed graph for use as starting locations in comparing topological connectivity of the compressed graphs.
    Type: Application
    Filed: March 20, 2009
    Publication date: September 23, 2010
    Applicant: Disney Enterprises, Inc.
    Inventors: RASMUS P. TAMSTORF, MICHAEL T. GOODRICH, DAVID EPPSTEIN