Shape Simplification Through Graph Sparsification

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-58961-9_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Simplification Orders for Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2016English

Learning Graph Prototypes for Shape Recognition

Computer Vision and Image Understanding
Signal ProcessingComputer VisionPattern RecognitionSoftware
2011English

Efficient Shape Matching via Graph Cuts

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Spectral Sparsification of Hypergraphs

2019English

Reeb Graph Based Shape Retrieval for CAD

2003English

Efficient Graph Cut Optimization for Shape From Focus

Journal of Visual Communication and Image Representation
Electronic EngineeringMedia TechnologySignal ProcessingComputer VisionElectricalPattern Recognition
2018English

The Minimal Kirchhoff Index of Theta Shape Graph

2017English

Sampling Shape Contours Using Optimization Over a Geometric Graph

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy