{"id":"https://openalex.org/W95788498","doi":"https://doi.org/10.1007/s004539910017","title":"Probabilistic Algorithms for Efficient Grasping and Fixturing","display_name":"Probabilistic Algorithms for Efficient Grasping and Fixturing","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W95788498","doi":"https://doi.org/10.1007/s004539910017","mag":"95788498"},"language":"en","primary_location":{"id":"doi:10.1007/s004539910017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004539910017","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043880698","display_name":"Marek Teichmann","orcid":"https://orcid.org/0000-0002-4380-4477"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Teichmann","raw_affiliation_strings":["MIT Laboratory for Computer Science, Cambridge, MA 02139, USA., , , , , , US"],"affiliations":[{"raw_affiliation_string":"MIT Laboratory for Computer Science, Cambridge, MA 02139, USA., , , , , , US","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053379558","display_name":"Bud Mishra","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]},{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Mishra","raw_affiliation_strings":["Courant Institute, New York University, NY 10012, USA., , , , , , US"],"affiliations":[{"raw_affiliation_string":"Courant Institute, New York University, NY 10012, USA., , , , , , US","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043880698"],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3897,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.68329638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"26","issue":"3-4","first_page":"345","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6992912888526917},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6785732507705688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6670534014701843},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5560662746429443},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5266913175582886},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5004456043243408},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.494307279586792},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4758864641189575},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4526869058609009},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4496300518512726},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4324505031108856},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4319623112678528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3662963807582855},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.30462175607681274},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.25023674964904785},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11817702651023865}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6992912888526917},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6785732507705688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6670534014701843},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5560662746429443},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5266913175582886},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5004456043243408},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.494307279586792},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4758864641189575},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4526869058609009},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4496300518512726},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4324505031108856},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4319623112678528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3662963807582855},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.30462175607681274},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.25023674964904785},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11817702651023865},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s004539910017","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004539910017","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.3926","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.3926","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graphics.lcs.mit.edu/~marekt/papers/ball.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.9403","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graphics.lcs.mit.edu/~marekt/papers/randgrasp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.3832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.3832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graphics.lcs.mit.edu/~marekt/papers/cccg-grasp.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1579678295","https://openalex.org/W1581442026","https://openalex.org/W1597469550","https://openalex.org/W1671328473","https://openalex.org/W1794703952","https://openalex.org/W1813896049","https://openalex.org/W1988106539","https://openalex.org/W2008581147","https://openalex.org/W2013833162","https://openalex.org/W2022357880","https://openalex.org/W2022671649","https://openalex.org/W2048517616","https://openalex.org/W2056501879","https://openalex.org/W2058212397","https://openalex.org/W2058432138","https://openalex.org/W2071676345","https://openalex.org/W2085363460","https://openalex.org/W2086674535","https://openalex.org/W2100440346","https://openalex.org/W2103893986","https://openalex.org/W2155892387","https://openalex.org/W3217246742"],"related_works":["https://openalex.org/W4248823117","https://openalex.org/W2004058166","https://openalex.org/W2030718493","https://openalex.org/W2018708907","https://openalex.org/W2103429114","https://openalex.org/W2005538657","https://openalex.org/W2088151573","https://openalex.org/W2004897847","https://openalex.org/W4385474329","https://openalex.org/W2469464399"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}