SPANNERS OF COMPLETE k-PARTITE GEOMETRIC GRAPHSBOSE, Prosenjit; CARMI, Paz; COUTURE, Mathieu et al.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1803-1820, issn 0097-5397, 18 p.Article

BINARY SPACE PARTITIONS FOR AXIS-ALIGNED FAT RECTANGLESTOTH, Csaba D.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 429-447, issn 0097-5397, 19 p.Article

Shadow metamorphosisKLIMMEK, B; PRAUTZSCH, H; VAHRENKAMP, N et al.Computing (Wien. Print). 2007, Vol 79, Num 2-4, pp 325-335, issn 0010-485X, 11 p.Conference Paper

Dynamic subgraph connectivity with geometric applicationsCHAN, Timothy M.SIAM journal on computing (Print). 2007, Vol 36, Num 3, pp 681-694, issn 0097-5397, 14 p.Article

SMALL-SIZE ε-NETS FOR AXIS-PARALLEL RECTANGLES AND BOXESARONOV, Boris; EZRA, Esther; SHARIR, Micha et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3248-3282, issn 0097-5397, 35 p.Article

Path multicoloring with fewer colors in spiders and caterpillarsPAGOURTZIS, A; POTIKA, K; ZACHOS, S et al.Computing (Wien. Print). 2007, Vol 80, Num 3, pp 255-274, issn 0010-485X, 20 p.Article

Embedding into the rectilinear plane in optimal O(n²) timeCATUSSE, Nicolas; CHEPOI, Victor; VAXES, Yann et al.Theoretical computer science. 2011, Vol 412, Num 22, pp 2425-2433, issn 0304-3975, 9 p.Article

Smoothness analysis of subdivision schemes by proximityWALLNER, Johannes.Constructive approximation. 2006, Vol 24, Num 3, pp 289-318, issn 0176-4276, 30 p.Article

Binary space partitions of orthogonal subdivisionsHERSHBERGER, John; SURI, Subhash; TOTH, Csaba D et al.SIAM journal on computing (Print). 2005, Vol 34, Num 6, pp 1380-1397, issn 0097-5397, 18 p.Article

TRANSFORMING TRIANGULATIONS ON NONPLANAR SURFACESCORTES, C; CRIMA, C. I; HURTADO, F et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 821-840, issn 0895-4801, 20 p.Article

PREPROCESSING IMPRECISE POINTS AND SPLITTING TRIANGULATIONSVAN KREVELD, Marc; LÖFFLER, Maarten; MITCHELL, Joseph S. B et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2990-3000, issn 0097-5397, 11 p.Article

IMPROVING THE STRETCH FACTOR OF A GEOMETRIC NETWORK BY EDGE AUGMENTATIONFARSHI, Mohammad; GIANNOPOULOS, Panos; GUDMUNDSSON, Joachim et al.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 226-240, issn 0097-5397, 15 p.Article

A characterization of quintic helicesBELTRAN, J. V; MONTERDE, J.Journal of computational and applied mathematics. 2007, Vol 206, Num 1, pp 116-121, issn 0377-0427, 6 p.Article

Repeated angles in three and four dimensionsAPFELBAUM, Roel; SHARIR, Micha.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 2, pp 294-300, issn 0895-4801, 7 p.Article

The rectilinear steiner arborescence problem is NP-completeWEIPING SHI; CHEN SU.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 729-740, issn 0097-5397, 12 p.Article

On the graph turnpike problemFEDER, Tomas; MOTWANI, Rajeev.Information processing letters. 2009, Vol 109, Num 14, pp 774-776, issn 0020-0190, 3 p.Article

DYNAMIC CONNECTIVITY: CONNECTING TO NETWORKS AND GEOMETRYCHAN, Timothy M; PATRASCU, Mihai; RODITTY, Liam et al.SIAM journal on computing (Print). 2011, Vol 40, Num 2, pp 333-349, issn 0097-5397, 17 p.Article

Constrained k-center and movement to independenceDUMITRESCU, Adrian; MINGHUI JIANG.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 859-865, issn 0166-218X, 7 p.Article

Settling the bound on the rectilinear link radius of a simple rectilinear polygonKATZ, Matthew J; MORGENSTERN, Gila.Information processing letters. 2011, Vol 111, Num 3, pp 103-106, issn 0020-0190, 4 p.Article

Some problems in distributed computational geometryRAJSBAUM, Sergio; URRUTIA, Jorge.Theoretical computer science. 2011, Vol 412, Num 41, pp 5760-5770, issn 0304-3975, 11 p.Article

Uniformly inserting points on square gridYONG ZHANG; ZHUO CHANG; CHIN, Francis Y. L et al.Information processing letters. 2011, Vol 111, Num 16, pp 773-779, issn 0020-0190, 7 p.Article

A parameterized algorithm for the hyperplane-cover problemJIANXIN WANG; WENJUN LI; JIANER CHEN et al.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 4005-4009, issn 0304-3975, 5 p.Article

Planar straight-line point-set embedding of trees with partial embeddingsBAGHERI, Alireza; RAZZAZI, Mohammadreza.Information processing letters. 2010, Vol 110, Num 12-13, pp 521-523, issn 0020-0190, 3 p.Article

QUALITY TRIANGULATIONS WITH LOCALLY OPTIMAL STEINER POINTSERTEN, Hale; ÜNGÖR, Alper.SIAM journal on scientific computing (Print). 2010, Vol 31, Num 3, pp 2103-2130, issn 1064-8275, 28 p.Article

Recognition of largest empty orthoconvex polygon in a point setNANDY, Subhas C; MUKHOPADHYAYA, Krishnendu; BHATTACHARYA, Bhargab B et al.Information processing letters. 2010, Vol 110, Num 17, pp 746-752, issn 0020-0190, 7 p.Article