Efficient Point Projection to Freeform Curves and Surfaces
Identifieur interne : 003D27 ( Main/Merge ); précédent : 003D26; suivant : 003D28Efficient Point Projection to Freeform Curves and Surfaces
Auteurs : Young-Taek Oh [Corée du Sud] ; Yong-Joon Kim [Corée du Sud] ; Jieun Lee [Corée du Sud] ; Myung-Soo Kim [Corée du Sud] ; Gershon Elber [Israël]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: We present an efficient algorithm for projecting a given point to its closest point on a family of freeform C 1-continuous curves and surfaces. The algorithm is based on an efficient culling technique that eliminates redundant curves and surfaces which obviously contain no projection from the given point. Based on this scheme, we can reduce the whole computation to considerably smaller subproblems, which are then solved using a numerical method. In several experimental results, we demonstrate the effectiveness of the proposed approach.
Url:
DOI: 10.1007/978-3-642-13411-1_13
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001798
- to stream Istex, to step Curation: 001798
- to stream Istex, to step Checkpoint: 000A66
Links to Exploration step
ISTEX:5B8FA6C6686FA7178575E304481F90C1561E661DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Point Projection to Freeform Curves and Surfaces</title><author><name sortKey="Oh, Young Taek" sort="Oh, Young Taek" uniqKey="Oh Y" first="Young-Taek" last="Oh">Young-Taek Oh</name></author><author><name sortKey="Kim, Yong Joon" sort="Kim, Yong Joon" uniqKey="Kim Y" first="Yong-Joon" last="Kim">Yong-Joon Kim</name></author><author><name sortKey="Lee, Jieun" sort="Lee, Jieun" uniqKey="Lee J" first="Jieun" last="Lee">Jieun Lee</name></author><author><name sortKey="Kim, Myung Soo" sort="Kim, Myung Soo" uniqKey="Kim M" first="Myung-Soo" last="Kim">Myung-Soo Kim</name></author><author><name sortKey="Elber, Gershon" sort="Elber, Gershon" uniqKey="Elber G" first="Gershon" last="Elber">Gershon Elber</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5B8FA6C6686FA7178575E304481F90C1561E661D</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-13411-1_13</idno><idno type="url">https://api.istex.fr/document/5B8FA6C6686FA7178575E304481F90C1561E661D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001798</idno><idno type="wicri:Area/Istex/Curation">001798</idno><idno type="wicri:Area/Istex/Checkpoint">000A66</idno><idno type="wicri:doubleKey">0302-9743:2010:Oh Y:efficient:point:projection</idno><idno type="wicri:Area/Main/Merge">003D27</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Point Projection to Freeform Curves and Surfaces</title><author><name sortKey="Oh, Young Taek" sort="Oh, Young Taek" uniqKey="Oh Y" first="Young-Taek" last="Oh">Young-Taek Oh</name><affiliation wicri:level="3"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>School of Computer Science and Eng., Seoul National Univ., 151-744, Seoul</wicri:regionArea><placeName><settlement type="city">Séoul</settlement></placeName></affiliation></author><author><name sortKey="Kim, Yong Joon" sort="Kim, Yong Joon" uniqKey="Kim Y" first="Yong-Joon" last="Kim">Yong-Joon Kim</name><affiliation wicri:level="3"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>School of Computer Science and Eng., Seoul National Univ., 151-744, Seoul</wicri:regionArea><placeName><settlement type="city">Séoul</settlement></placeName></affiliation></author><author><name sortKey="Lee, Jieun" sort="Lee, Jieun" uniqKey="Lee J" first="Jieun" last="Lee">Jieun Lee</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>School of Computer Science and Eng., Chosun Univ., 501-759, Kwangju</wicri:regionArea><wicri:noRegion>Kwangju</wicri:noRegion></affiliation></author><author><name sortKey="Kim, Myung Soo" sort="Kim, Myung Soo" uniqKey="Kim M" first="Myung-Soo" last="Kim">Myung-Soo Kim</name><affiliation wicri:level="3"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>School of Computer Science and Eng., Seoul National Univ., 151-744, Seoul</wicri:regionArea><placeName><settlement type="city">Séoul</settlement></placeName></affiliation></author><author><name sortKey="Elber, Gershon" sort="Elber, Gershon" uniqKey="Elber G" first="Gershon" last="Elber">Gershon Elber</name><affiliation wicri:level="1"><country xml:lang="fr">Israël</country><wicri:regionArea>Computer Science Department, Technion, 32000, Haifa</wicri:regionArea><wicri:noRegion>Haifa</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">5B8FA6C6686FA7178575E304481F90C1561E661D</idno><idno type="DOI">10.1007/978-3-642-13411-1_13</idno><idno type="ChapterID">13</idno><idno type="ChapterID">Chap13</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present an efficient algorithm for projecting a given point to its closest point on a family of freeform C 1-continuous curves and surfaces. The algorithm is based on an efficient culling technique that eliminates redundant curves and surfaces which obviously contain no projection from the given point. Based on this scheme, we can reduce the whole computation to considerably smaller subproblems, which are then solved using a numerical method. In several experimental results, we demonstrate the effectiveness of the proposed approach.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/HapticV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003D27 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 003D27 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= HapticV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:5B8FA6C6686FA7178575E304481F90C1561E661D
|texte= Efficient Point Projection to Freeform Curves and Surfaces
}}
| This area was generated with Dilib version V0.6.23. |  |