Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Segmento recta")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 593

  • Page / 24
Export

Selection :

  • and

Separating and shattering long line segmentsEFRAT, A; SCHWARZKOPF, O.Information processing letters. 1997, Vol 64, Num 6, pp 309-314, issn 0020-0190Article

Line-segment intersection made in-placeVAHRENHOLD, Jan.Lecture notes in computer science. 2005, pp 146-157, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

Chain-based extraction of line segments to describe imagesCHALECHALE, Abdolah; NAGHDY, Golshah; PREMARATNE, Prashan et al.IEEE International Conference on multimedia. 2004, isbn 0-7803-8603-5, 3Vol, vol1, 355-358Conference Paper

On constrained minimum pseudotriangulationsROTE, Günter; CAO AN WANG; LUSHENG WANG et al.Lecture notes in computer science. 2003, pp 445-454, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segmentsPALIOS, L.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 57-92, issn 0196-6774Article

Excess in arrangements of segmentsSHARIR, M.Information processing letters. 1996, Vol 58, Num 5, pp 245-247, issn 0020-0190Article

Applications harmoniques de B3 dans S2 ayant une ligne de singularités = Axially symmetric harmonic maps from B3 into S2 having a line of singularitiesRIVIERE, T.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1991, Vol 313, Num 9, pp 583-587, issn 0764-4442Article

Efficiency of the NPMLE in the line-segment problemVAN DER LAAN, M. J.Scandinavian journal of statistics. 1996, Vol 23, Num 4, pp 527-550, issn 0303-6898Article

On the directionality of interval ordersBOUCHITTE, V; JEGOU, R; RAMPON, J.-X et al.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 87-92, issn 0166-218XArticle

Guarding a line segmentKAWECKI, P; KRASKA, B; MAJCHEREK, K et al.Systems & control letters. 2009, Vol 58, Num 7, pp 540-545, issn 0167-6911, 6 p.Article

Analysis of the nicholl-lee-nicholl algorithmDEVAI, Frank.Lecture notes in computer science. 2005, pp 726-736, issn 0302-9743, isbn 3-540-25860-4, 4Vol, 11 p.Conference Paper

Pattern classification using rectified nearest feature line segmentHAO DU; YAN QIU CHEN.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28312-9, 2Vol, Part II, 81-90Conference Paper

Pointed binary encompassing treesHOFFMANN, Michael; SPECKMANN, Bettina; TOTH, Csaba D et al.Lecture notes in computer science. 2004, pp 442-454, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Inner rectangular drawings of plane graphsMIURA, Kazuyuki; HAGA, Hiroki; NISHIZEKI, Takao et al.Lecture notes in computer science. 2004, pp 693-704, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

Evaluation of rotational kernel transformation technique for enhancement of coronary optical coherence tomography imagesROGOWSKA, Jadwiga; BREZINSKI, Mark E.SPIE proceedings series. 2000, pp 285-294, isbn 0-8194-3768-9Conference Paper

Morphological operators with discrete line segmentsSOILLE, Pierre.Lecture notes in computer science. 2000, pp 78-98, issn 0302-9743, isbn 3-540-41396-0Conference Paper

Coding of digital straight lines by continued fractionsVOSS, K.Computers and artificial intelligence. 1991, Vol 10, Num 1, pp 75-80, issn 0232-0274Article

Fuzzy screen detector to improve performance of vision-based pointing deviceJANG, S; YOON, C; PARK, M et al.Electronics Letters. 2008, Vol 44, Num 21, pp 1247-1249, issn 0013-5194, 3 p.Article

Iterated snap rounding with bounded driftPACKER, Eli.SCG : symposium on computational geometry. 2006, pp 367-376, isbn 1-59593-340-9, 1Vol, 10 p.Conference Paper

An on-line sketch recognition algorithm for composite shapeZHAN DING; YIN ZHANG; WEI PENG et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28312-9, 2Vol, Part II, 120-129Conference Paper

Bounds for convex crossing numbersSHAHROKHI, Farhad; SYKORA, Ondrej; SZEKELY, Laszlo A et al.Lecture notes in computer science. 2003, pp 487-495, issn 0302-9743, isbn 3-540-40534-8, 9 p.Conference Paper

Billiard quorums on the grid 1AGRAWAL, D; EGECIOGLU, Ö; AMR EL ABBADI et al.Information processing letters. 1997, Vol 64, Num 1, pp 9-16, issn 0020-0190Article

ED line and polygon clipping based on space subdivisionSLATER, M; BARSKY, B. A.The Visual computer. 1994, Vol 10, Num 7, pp 407-422, issn 0178-2789Article

n+1 segments beat nTÖROCSIK, J.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 3, pp 491-500, issn 0895-4801Article

Illuminating labyrinthsTOTH, Csaba D.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 215-228, issn 0166-218X, 14 p.Conference Paper

  • Page / 24