7 views

Uploaded by xrubeng

- Lecture Notes for Sections 2.52.6
- Geometric Mean Labeling
- 4. Mathematics - Ijmcar-h-packing of Some Interconnection Networks
- lec1003 (1)
- Woods1
- Graph Algorithm for Software Model Cheking
- Lecture 1
- Total Colouring
- Spin Image Based on Local Shape Similarity and Its Application.pdf
- Customizing MineSight® 3-D
- 22-web
- sol9.pdf
- Vector Analysis
- How to Create a Homing Missile Using Blueprints in Unreal Engine 4
- lec-flow-4
- What is Answer Set Programming
- x 4102188192
- ip-rsync
- Edu Cat en Sr1 Fi v5r19 Toprint
- Coloring Graph

You are on page 1of 22

Problem

Identifying a cycle of curves in the network that bounds an individual surface patch Data: 3D network curves. Example: Automatic surfaces patch creation

Introduction

An important task in 3D curve modelling is identifying a cycle of curves in the network that bounds an individual surface patch. Many algorithms for cycle discovery have been proposed in the past:

To tame the search complexity, they rely on stringent assumptions on either the geometry or the topology of their output. Some methods only look for planar cycles, while others are usually limited to cycles that define either a manifold surface with genus 0

Related Work

Planar graph embedding: If the curve network encodes a planar graph that is 3-connected, the cycles can be found efficiently by computing the (unique) planar embedding of the graph. For curve networks whose graphs are only 2-connected (but still planar), the planar embedding is not unique, and heuristic searches have been proposed that seek an optimal embedding guided by geometric criteria.

Related Work

Decomposition approach decomposes the solid object represented by a curve network into tetrahedra and merges the faces of those tetrahedra into cycles. However, since the algorithm relies on mostly topological information (e.g., degree at each junction), the method may easily create erroneous output on geometrically ambiguous models

Related Work

Another popular approach is to perform an exhaustive search over the space of all cycles, guided by some form of geometric cost and/or topological constraints. To reduce the search complexity, methods in this class only identify cycles with a limited variety of geometry, suchas planar cycles

Overview

The key idea behind, which lends efciency without sacricing generality, is exploring a different search space. While previous methods search in the space of cycles, this work looks for mappings locally at a vertex or a curve that describes how the incident curves are grouped into cycles.

Overview

A collection of such mappings over all vertices and curves, is called a routing system, uniquely determines a set of cycles, and vice versa The advantage of considering the routing system is that the number of mappings at each vertex or curve is far fewer than the number of cycles in a network.

Overview

A collection of such mappings over all vertices and curves, called a routing system, uniquely determines a set of cycles, and vice versa The advantage of considering the routing system is that the number of mappings at each vertex or curve is far fewer than the number of cycles in a network.

Definitions

The degree of a vertex refers to the number of its incident curves. A cycle is a closed walk in the graph. A cycle is simple if no vertex or curve appears more than once in the walk. Given a set of cycles, the number of times that a curve is used in these cycles is called the degree of that curve The prescribed degree of a curve is the curves capacity

Definitions

Capacity constraints need to satisfy two conditions to guarantee the existence of a cycle that are free of U-turns:

the sum of capacity of curves incident to a vertex v is even the capacity of any curve incident to v is no greater than the sum of the capacities of the remaining curves incident to v.

Routing System

Two types of groupings curves: two curves {a, b} incident to a common vertex form a corner if {a, b} are consecutive in one cycle. two corners {a, b},{b, c}, one at each end of a curve b, form a bridge if {a, b, c} are consecutive in one cycle. This representation of cycles, consisting of corners and bridges, a routing system

Algorithm

Each variable in a routing system is local and has a much smaller range of choices than a variable in a cycle set. While the number of cycles grows exponentially with the size of the entire network; The number of possible corner mappings at a vertex (or possible bridge mappings at a curve) only depends on the degree at the vertex (or the capacity at the curve).

Cost metrics

The rst metric, the intra-bridge cost, acts on a single bridge and favors the bridge that borders a smooth and convex patch. The second metric, the inter-bridge cost, acts on a group of bridges and favors the group whose corresponding patches meet at a curve with small normal discontinuity.

Cost metrics

The rst metric, the intra-bridge cost, acts on a single bridge and favors the bridge that borders a smooth and convex patch. The second metric, the inter-bridge cost, acts on a group of bridges and favors the group whose corresponding patches meet at a curve with small normal discontinuity.

Intra-bridge cost

Consider a bridge that involves a sequence of three curves {a, b, c}: For simple cycles, test whether there is a path in the curve network connecting curves a and c without visiting b or its end vertices. If such a path does not exist, the intra-bridge cost is set to innity. Otherwise, the cost is computed based on the geometry of the bridge.

Intra-bridge cost

Measures the smoothness (as changes in surface normal) and convexity (as sum of interior angles) of the most smooth and convex patch that has the bridge as its border. A patch is implicitly represented by a family of normal vectors, one associated with each line segment of curves {a, b, c}.

Intra-bridge cost

This normals are generated by parallel-transporting [Wang et al. 2008] an initial normal vector at the rst line segment of a.

Intra-bridge cost

The evaluation is done at each of the two bridge vertices. Let e1, e2 be the vector for the two incident line segments of the vertex, oriented consistently along the bridge, and n1, n2 be the normal on each segment. Smoothness is measured by the bending angle, which is simply the angle formed by n1 and n2.

Intra-bridge cost

Convexity is measured by the interior angle, which is the sum of the two angles formed by ei, and the intersecting line l of the two planes whose normals are respectively ni (i = 1,2). l = n1 (e1 + e2), which is stable even when n1 = n2. The cost for the normal family is given by the sum of bending angles and interior angles at the two bridge vertices. The intrabridge cost is the minimum cost among all paralleltransport normal families on the bridge.

Inter-bridge cost

Consider the set of all bridges {ai, b, ci} in a routing system for i = 1, . . . , k over a curve b with capacity k. Patches that are bounded by these bridges to meet as smooth as possible along b. In the best conguration, these patches should partition the space around b in a uniform manner. That is, if we order the patches radially around curve b, the dihedral angles between consecutive patches should be identically 2/k. In the worst conguration, all k patches overlap.

Inter-bridge cost

Let ni be the normal on the rst line segment of b in the normal family that attains the intra-bridge cost for the bridge {ai, b, ci}. Assuming that ni are sorted radially around that line segment, and let i be the angle formed by normals ni, ni+1. The interbridge cost is dened as:

Optimal Solution

Dynamic programming algorithm is used to find the optimal solution. Starting from a single vertex of the curve network, the algorithm finds the minimum-weight subgraph that covers an increasing larger set of vertices. A vertex set V which starts off as an empty set and gets expanded by one vertex at a time. After an expansion, for each possible combination of nodes that cover V it is computed the minimum-weight subgraph of G that covers the entire V. The algorithm terminates when V contains all vertices

- Lecture Notes for Sections 2.52.6Uploaded byUmair Masood Memon
- Geometric Mean LabelingUploaded byJoel Carredo
- 4. Mathematics - Ijmcar-h-packing of Some Interconnection NetworksUploaded byTJPRC Publications
- lec1003 (1)Uploaded bySwapneel Jadhav
- Woods1Uploaded bydutt_victor
- Graph Algorithm for Software Model ChekingUploaded byLuki Bangun Subekti
- Lecture 1Uploaded bykostas_ntougias5453
- Total ColouringUploaded byVanessa Borges
- Spin Image Based on Local Shape Similarity and Its Application.pdfUploaded byivy_publisher
- Customizing MineSight® 3-DUploaded by11804
- 22-webUploaded byBada Sainath
- sol9.pdfUploaded byAashish D
- Vector AnalysisUploaded byJia Hao
- How to Create a Homing Missile Using Blueprints in Unreal Engine 4Uploaded bySherri Gibson
- lec-flow-4Uploaded byUmesh Chandra
- What is Answer Set ProgrammingUploaded byKhuong Phan
- x 4102188192Uploaded byAnonymous 7VPPkWS8O
- ip-rsyncUploaded byChakravarthi Chittajallu
- Edu Cat en Sr1 Fi v5r19 ToprintUploaded byOctavio Urbina
- Coloring GraphUploaded byMas Rudi
- GeometUploaded byManuel Norberto Montoya Quezada
- Burns Hasselblat-The Sarkoviskii TheoremUploaded byGabriel Crestani
- 3746-10033-1-SMUploaded bysouvik roy
- Bezier Curve Modeling for Neutrosophic Data ProblemUploaded byMia Amalia
- 5 2 a a geometric constraints javier prietoUploaded byapi-268997163
- 3D-geomentryUploaded byjunaid
- Rohit MathsUploaded byPiyush Arora
- Curve Sketching BAND5_6.pdfUploaded byAnonymous 77ngihkyl
- Turbine Blade FuentUploaded byRenzo Vargas
- Simpsons Rule Not EsesUploaded byAbdulMalek

- 11. Maths - IJMCAR - Construction - Srinivasa RaoUploaded byTJPRC Publications
- GraphTheory SlidesUploaded bysharmaegayangos
- Unsql SpecUploaded byDiego Rivera
- Disjoint Sets Union Find AlgorithmsUploaded byGubbala Sandeep
- Cayley-Graph-Based Data Centers and Space Requirements of a Routing Scheme Using AutomataUploaded byMiguel Camelo
- Advanced Computer Architecture M.tech VLSIUploaded byPronadeep Bora
- Department of Computer Science and EngineeringUploaded byManikandan Subbaraja
- Data Flow Testing - StrategiesUploaded bySunit Prasad
- Intro Shortpath AlgortihmUploaded byyanuangga
- hw5-rajKorpally_rithvikgambhir.odtUploaded byKoushik Reddy
- ACSL-GraphTheoryUploaded byPKDianna
- Connected Total Dominating Sets and Connected Total Domination Polynomials of Stars and WheelsUploaded byInternational Organization of Scientific Research (IOSR)
- SP14 CS188 Lecture 2 -- Uninformed Search.pptxUploaded bymitiwana
- Important Problem TypesUploaded bySahila Devi
- Network science Chapter 7Uploaded byStfn1990
- Question BankUploaded byshalika booma
- Maths sem_V_and_VIUploaded byMuhammad Maaz
- Graph TheoryUploaded bysouravrockz
- Networks of the BrainUploaded byChaoyi Kang
- Loop Cutset.pdfUploaded bySrikrishna Jana
- Automata.pdfUploaded byTony
- INTERPRETING THE SEMANTICS OF ANOMALIES BASED ON MUTUAL INFORMATION IN LINKMININGUploaded byMaurice Lee
- Fair Domination in the Join,Uploaded byLeonel L. Pabilona
- CoordinatePlane.docUploaded byAngla Barrants
- Ada Lab ManualUploaded byManohar NV
- Math GraphsUploaded byandrew_ferrell_magee
- Chap 5Uploaded bySheetal_Shiree_5277
- QUESTION BANK FOR THIRD YEAR 5TH SEM DISCRETE MATHAMETICS 2013 REGULATIONUploaded byPRIYA RAJI
- R TutorialUploaded byqwertyraul
- Detroit Case StudyUploaded bySilvia Massi