Results 1  10
of
3,811
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
. With this algorithm, fairing very large surfaces, such as those obtained from volumetric medical data, becomes affordable. By combining this algorithm with surface subdivision methods we obtain a very effective fair surface design technique. We then extend the analysis, and modify the algorithm accordingly
Trading Group Theory for Randomness
, 1985
"... In a previous paper [BS] we proved, using the elements of the Clwory of nilyotenf yroupu, that some of the /undamcnla1 computational problems in mat & proup, belong to NP. These problems were also ahown to belong to CONP, assuming an unproven hypofhedi.9 concerning finilc simple Q ’ oup,. The a ..."
Abstract

Cited by 353 (9 self)
 Add to MetaCart
,. The aim of this paper is t.o replace most of the (proven and unproven) group theory of IBS] by elementary combinatorial argumenls. The rev & we prove is that relative to a random oracle f3, tbc meutioned matrix group problems belong to (NPncoNP)L! Thr problems we consider arr membership in and order
Flatness and defect of nonlinear systems: Introductory theory and examples
 International Journal of Control
, 1995
"... We introduce flat systems, which are equivalent to linear ones via a special type of feedback called endogenous. Their physical properties are subsumed by a linearizing output and they might be regarded as providing another nonlinear extension of Kalman’s controllability. The distance to flatness is ..."
Abstract

Cited by 346 (23 self)
 Add to MetaCart
We introduce flat systems, which are equivalent to linear ones via a special type of feedback called endogenous. Their physical properties are subsumed by a linearizing output and they might be regarded as providing another nonlinear extension of Kalman’s controllability. The distance to flatness
Piecewise smooth surface reconstruction
, 1994
"... We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of applications such as reverse engineering — the automatic generation of CAD models from physical objects. Novel aspects of t ..."
Abstract

Cited by 303 (13 self)
 Add to MetaCart
of the method are its ability to model surfaces of arbitrary topological type and to recover sharp features such as creases and corners. The method has proven to be effective, as demonstrated by a number of examples using both simulated and real data. A key ingredient in the method, and a principal contribution
Matching Events in a Contentbased Subscription System
, 2003
"... Contentbased subscription systems are an emerging alternative to traditional publishsubscribe systems, because they permit more flexible subscriptions along multiple dimensions. In these systems, each subscription is a predicate which may test arbitrary attributes within an event. However, the mat ..."
Abstract

Cited by 303 (8 self)
 Add to MetaCart
linear in the number of subscriptions, and it has a space complexity that is linear. Specifically, we prove that for predicates reducible to conjunctions of elementary tests, the expected time to match a random event is no greater than O#N # where N is the number of subscriptions, and # is a closedform expression
4–8 Subdivision
, 2000
"... In this paper we introduce 4–8 subdivision, a new scheme that generalizes the fourdirectional box spline of class � � to surfaces of arbitrary topological type. The crucial advantage of the proposed scheme is that it uses bisection refinement as an elementary refinement operation, rather than more c ..."
Abstract

Cited by 66 (6 self)
 Add to MetaCart
In this paper we introduce 4–8 subdivision, a new scheme that generalizes the fourdirectional box spline of class � � to surfaces of arbitrary topological type. The crucial advantage of the proposed scheme is that it uses bisection refinement as an elementary refinement operation, rather than more
Subdivision Tree Representation of Arbitrary Triangle Meshes
, 1998
"... We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary tri ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary
Subdivision Tree Representation of Arbitrary Triangle Meshes
, 1998
"... We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary tri ..."
Abstract
 Add to MetaCart
We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary
Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology
 Computer Graphics Forum
, 1996
"... A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satisfies important requirements for practical applications in computer graphics and engineering. These requirements include the necessity to ..."
Abstract

Cited by 154 (10 self)
 Add to MetaCart
to preserve the consistency of such adaptively refined nets. Keywords: Curve and surface modeling, Interpolatory subdivision, Adaptive meshrefinement 1 Introduction The problem we address in this paper is the generation of smooth interpolating surfaces of arbitrary topological type in the context
System analysis via integral quadratic constraints

, 1997
"... This paper introduces a unified approach to robustness analysis with respect to nonlinearities, time variations, and uncertain parameters. From an original idea by Yakubovich, the approach has been developed under a combination of influences from the Western and Russian traditions of control theor ..."
Abstract

Cited by 234 (13 self)
 Add to MetaCart
theory. It is shown how a complex system can be described, using integral quadratic constraints (IQC’s) for its elementary components. A stability theorem for systems described by IQC’s is presented that covers classical passivity/dissipativity arguments but simplifies the use of multipliers
Results 1  10
of
3,811