نتایج جستجو برای: geometric design

تعداد نتایج: 1039146  

2005
S. Laws C. Gadda S. Kohn P. Yih J. C. Milroy

With steer-by-wire, suspension and steering systems are no longer governed by purely mechanical criteria but must instead be designed according to mechatronic considerations. This paper demonstrates an approach to steer-bywire suspension design in which geometric design variables are chosen to render the tire reaction torque about the steer axis highly predictable. This predictability, in turn,...

Journal: :Computer Aided Geometric Design 2010
Laurent Busé Thang Luu Ba

Given a parameterization of an algebraic rational curve in a projective space of arbitrary dimension, we introduce and study a new implicit representation of this curve which consists in the locus where the rank of a single matrix drops. Then, we illustrate the advantages of this representation by addressing several important problems of Computer Aided Geometric Design: The point-on-curve and i...

2005
Chih-Hsing Chu Jang-Ting Chen

This paper studies geometric design of developable composite Bézier surfaces from two boundary curves. The number of degrees of freedom (DOF) is characterized for the surface design by deriving and counting the developability constraints imposed on the surface control points. With a first boundary curve freely chosen, ð2m þ 3Þ, ðm þ 4Þ, and five DOFs are available for a second boundary curve of...

2007
Mohamed Elkadi Alain Yger

We present a new algorithm in order to compute the multidimensional residue of a polynomial map based on a perturbation argument and the Generalized Transformation Law. Then we use it for studying some fundamental problems in Computer Aided Geometric Design.

Journal: :J. Symb. Comput. 2007
Sonia Pérez-Díaz

Given an algebraic plane curve C defined by a rational parametrization P(t), we present formulae for the computation of the degree of C, and the multiplicity of a point. Using the results presented in [Sendra, J.R., Winkler, F., 2001. Tracing index of rational curve parametrizations. Computer Aided Geometric Design 18 (8), 771–795], the formulae simply involve the computation of the degree of a...

Journal: :Computer Aided Geometric Design 1992
Ronald A. DeVore Björn D. Jawerth Bradley J. Lucier

DeVore, R.A., B. Jawerth and B.J. Lucier, Surface compression, Computer Aided Geometric Design 9 (1992) 219-239. We propose wavelet decompositions as a technique for compressing the number of a control parameters of surfaces that arise in Computer-Aided Geometric Design. In addition, we give a specific numerical algorithm for surface compression based on wavelet decompositions of surfaces into ...

2000
M. Gasca

In this survey, we will show some connections between several mathematical problems such as extrapolation, linear systems, totally positive matrices and computer-aided geometric design, with elimination techniques as the common tool to deal with all of them. c © 2000 Elsevier Science B.V. All rights reserved.

2011
Gang Liu Guojin Wang

DP curves, which possess the shape-preserving property and linear complexity evaluation algorithm, occupy a significantly important place in computer aided geometric design. Thus to do the research on the DP curves algorithms has a positive meaning. Aphirukmatakun et al. presented a degree elevation algorithm of DP curves based on the transformation between the DP basis and power basis. At the ...

Journal: :Computer Aided Geometric Design 1991
Michael A. Lachance Arthur J. Schwartz

Lachance. M.A. and A.J. Schwartz. Four point parabolic interpolation, Computer Aided Geometric Design 8 (1991) 143-149. We show that four points in the plane may be interpolated by one or two parabolas or possibly by no parabola, depending on the configuration of points. We provide methods for distinguishing the cases and constructing the parabolas.

Journal: :IEEE Trans. Parallel Distrib. Syst. 1998
Venkatavasu Bokka Himabindu Gurla Stephan Olariu James L. Schwing

A number of applications in computer-aided manufacturing, CAD, and computer-aided geometric design ask for triangulating pieces of material with defects. These tasks are known collectively as constrained triangulations. Recently, a powerful architecture called the reconng-urable mesh has been proposed: in essence, a reconngurable mesh consists of a mesh-connected architecture augmented by a dyn...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->