Patents by Inventor William C. Regli
William C. Regli 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: 9596125Abstract: The Location Design and Routing problem asks to find a subset of “depot” nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.Type: GrantFiled: April 3, 2014Date of Patent: March 14, 2017Assignee: Drexel UniversityInventors: William C. Regli, Ali Shokoufandeh, Evan A. Sultanik
-
Publication number: 20140351398Abstract: The Location Design and Routing problem asks to find a subset of “depot” nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.Type: ApplicationFiled: April 3, 2014Publication date: November 27, 2014Applicant: Drexel UniversityInventors: William C. Regli, Ali Shokoufandeh, Evan A. Sultanik
-
Publication number: 20130080443Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.Type: ApplicationFiled: July 25, 2012Publication date: March 28, 2013Applicant: DREXEL UNIVERSITYInventors: WILLIAM C. REGLI, ALI SHOKOUFANDEH, DMITRIY BESPALOV
-
Patent number: 8266079Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.Type: GrantFiled: July 19, 2011Date of Patent: September 11, 2012Assignee: Drexel UniversityInventors: William C. Regli, Ali Shokoufandeh, Dmitriy Bespalov
-
Publication number: 20120136860Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.Type: ApplicationFiled: July 19, 2011Publication date: May 31, 2012Applicant: DREXEL UNIVERSITYInventors: WILLIAM C. REGLI, ALI SHOKOUFANDEH, DMITRIY BESPALOV
-
Publication number: 20110246636Abstract: The Location Design and Routing problem asks to find a subset of “depot” nodes and a spanning forest of a graph such that every connected component in the forest contains at least one depot. This problem arises in a number of both logistical and computer networking problems, for example, in selecting the number and location of distribution centers in vehicle routing networks. This problem is functionally equivalent to that of supernode selection in peer-to-peer networks. A distributed algorithm approximates a solution to this problem that runs in a logarithmic number of communication rounds with respect to the number of nodes (independent of the topology of the network), and, under assumptions on the embedding of the edge weights, whose solutions are within a factor of 2 of optimal.Type: ApplicationFiled: March 16, 2011Publication date: October 6, 2011Applicant: DREXEL UNIVERSITYInventors: William C. Regli, Ali Shokoufandeh, Evan Andrew Sultanik
-
Patent number: 8015125Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.Type: GrantFiled: August 30, 2007Date of Patent: September 6, 2011Assignee: Drexel UniversityInventors: William C. Regli, Ali Shokoufandeh, Dmitriy Bespalov
-
Patent number: 7889914Abstract: A method of providing an automated classifier for 3D CAD models wherein the method provides an algorithm for learning new classifications. The method enables existing model comparison algorithms to adapt to different classifications that are relevant in many engineering applications. This ability to adapt to different classifications allows greater flexibility in data searching and data mining of engineering data.Type: GrantFiled: June 5, 2009Date of Patent: February 15, 2011Assignee: Drexel UniversityInventors: William C. Regli, Cheuk Yiu Ip, Leonard Sieger
-
Patent number: 7761265Abstract: A method for determining a similarity of a first solid model to a second solid model is disclosed. The method includes the steps of: selecting a set of features for representing the first solid model; extracting features corresponding to the selected set of features from the first solid model; constructing an undirected model dependency graph of the first solid model based on the selected set of features; extracting features corresponding to the selected set of features from the second solid model; constructing an undirected model dependency graph of the second solid model based on the selected set of features; comparing the undirected model dependency graph of the first solid model with the undirected model dependency graph of the second solid model; and outputting a numerical measure indicative of the similarity of the first solid model to the second solid model.Type: GrantFiled: May 6, 2003Date of Patent: July 20, 2010Assignee: Drexel UniversityInventors: William C. Regli, Vincent A. Cicirello
-
Patent number: 7639868Abstract: A method of providing an automated classifier for 3D CAD models wherein the method provides an algorithm for learning new classifications. The method enables existing model comparison algorithms to adapt to different classifications that are relevant in many engineering applications. This ability to adapt to different classifications allows greater flexibility in data searching and data mining of engineering data.Type: GrantFiled: June 16, 2004Date of Patent: December 29, 2009Assignee: Drexel UniversityInventors: William C. Regli, Cheuk Yiu Ip, Leonard Sieger
-
Publication number: 20090319454Abstract: A method of providing an automated classifier for 3D CAD models wherein the method provides an algorithm for learning new classifications. The method enables existing model comparison algorithms to adapt to different classifications that are relevant in many engineering applications. This ability to adapt to different classifications allows greater flexibility in data searching and data mining of engineering data.Type: ApplicationFiled: June 5, 2009Publication date: December 24, 2009Applicant: DREXEL UNIVERSITYInventors: WILLIAM C. REGLI, Cheuk Yiu Ip, Leonard Sieger
-
Publication number: 20080215510Abstract: A scale-Space feature extraction technique is based on recursive decomposition of polyhedral surfaces into surface patches. The experimental results show that this technique can be used to perform matching based on local model structure. Scale-space techniques can be parameterized to generate decompositions that correspond to manufacturing, assembly or surface features relevant to mechanical design. One application of these techniques is to support matching and content-based retrieval of solid models. Scale-space technique can extract features that are invariant with respect to the global structure of the model as well as small perturbations that 3D laser scanning may introduce. A new distance function defined on triangles instead of points is introduced. This technique offers a new way to control the feature decomposition process, which results in extraction of features that are more meaningful from an engineering viewpoint. The technique is computationally practical for use in indexing large models.Type: ApplicationFiled: August 30, 2007Publication date: September 4, 2008Applicant: DREXEL UNIVERSITYInventors: WILLIAM C. REGLI, ALI SHOKOUFANDEH, DMITRIY BESPALOV
-
Publication number: 20030208285Abstract: A method for determining a similarity of a first solid model to a second solid model is disclosed. The method includes the steps of: selecting a set of features for representing the first solid model; extracting features corresponding to the selected set of features from the first solid model; constructing an undirected model dependency graph of the first solid model based on the selected set of features; extracting features corresponding to the selected set of features from the second solid model; constructing an undirected model dependency graph of the second solid model based on the selected set of features; comparing the undirected model dependency graph of the first solid model with the undirected model dependency graph of the second solid model; and outputting a numerical measure indicative of the similarity of the first solid model to the second solid model.Type: ApplicationFiled: May 6, 2003Publication date: November 6, 2003Applicant: Drexel UniversityInventors: William C. Regli, Vincent A. Cicirello