-
公开(公告)号:US20230229821A1
公开(公告)日:2023-07-20
申请号:US18096680
申请日:2023-01-13
发明人: Henri PITKÄNEN , Vadym SHPYNDA , Pascal FILOCHE , Lassi NIEMINEN
CPC分类号: G06F30/12 , G06F30/13 , G06F2111/20
摘要: Mechanisms to increase level of detail in sets of model objects in a model for a construction product are disclosed, the mechanism utilizing a collection comprising a plurality of collection sets with details in metadata. For example, to increase level of detail in a set of model objects, content of a first metadata is determined. The first metadata comprises information indicating at least a type and geometry of the set of model objects. The collection sets are sorted to a suitability order based on compatibility of the first metadata to metadata of the collection sets. If the most suitable collection set is approved, the level of detail of the set of model objects is increased by adding to the first metadata copies of one or more details in the metadata of the most suitable collection set.
-
公开(公告)号:US10921961B2
公开(公告)日:2021-02-16
申请号:US16011232
申请日:2018-06-18
发明人: Teemu Rantanen , Teemu Heikkonen , Justiina Heilimo , Jenny Ginman , Mika Uimonen , Jukka Lavonen , Sampo Syrjänen
IPC分类号: G06F17/20 , G06F3/0484 , G06F16/21 , G06F9/451 , G06F40/197
摘要: In a lossless undo mechanism history log information on completed actions and reversed actions created by one or more completed undo functions is maintained. The lossless undo mechanism causes an undo loop between a first state created by an action to which the undo function is performed and a second state created by the last reversed action of the completed undo function. The first and second state form a pair of ends of the undo loop. The pairs of ends are used to determine intersecting undo loops. Further, a predetermined rule set is used to determine which one of two or more intersecting undo loops is selected to be outputted as an undo loop in a tree-view structure that is outputted to illustrate the history log information.
-
公开(公告)号:US20160217223A1
公开(公告)日:2016-07-28
申请号:US15005388
申请日:2016-01-25
发明人: Elja Kontturi , Jukka Suomi , Ragnar Wessman , Teemu Heikkonen
IPC分类号: G06F17/50
CPC分类号: G06F17/50
摘要: A modeling application is provided with at least one spatial modificator for modifying simultaneously one or more object instances.
摘要翻译: 提供具有用于同时修改一个或多个对象实例的至少一个空间修改器的建模应用。
-
公开(公告)号:US20220058301A1
公开(公告)日:2022-02-24
申请号:US17404065
申请日:2021-08-17
发明人: Mikko Huovila , Tapio Kohonen , Petri Heinonen , David Bartliff
摘要: A digital model of a structure comprises a physical BIM model and one or more analysis models for structural engineering, wherein a piece of the structure may have one digital representation, called a physical part, in the physical BIM model, and one digital representation, called an analysis part, in one of the analysis models, but there may be analysis parts without corresponding physical parts, and vice versa. Association information associating an analysis part with a corresponding physical part allows a soft relation between the parts, the soft relation being usable for indicating that a part's corresponding part has changed without changing the part correspondingly.
-
公开(公告)号:US11250179B2
公开(公告)日:2022-02-15
申请号:US16668425
申请日:2019-10-30
发明人: Jukka Suomi , Oxana Kyllönen , Mikko Huovila , Charles Pool , Ville Rousu , Henri Pitkänen , Tommi Martela
摘要: To enable to display one or more drawing content, which have been created during defining one or more engineering drawings from a model which comprises one or more parts to model one or more structures, digital twins of the one or more drawing content with associated information are created and published. The associated information of the digital twin comprises three-dimensional coordinates for the drawing content in question, determined based on one or more parts, to which the drawing content relates, and identifying information of said one or more parts.
-
公开(公告)号:US11080470B2
公开(公告)日:2021-08-03
申请号:US16241773
申请日:2019-01-07
发明人: Lassi Nieminen , Henri Pitkänen
IPC分类号: G06F30/20 , G06F40/169 , G06T11/60 , G06F111/12
摘要: A solution that automatically fine-tunes label locations in an engineering drawing is disclosed. The label locations are fine-tuned by performing a line-line solving process, a frame-frame solving process and a frame-line solving process according to a first order of the processes, and repeating performing the processes according to the first order as long as during performing the processes one or more frames have been moved to another location and a first repeat criterion is met. Each solving process repeats determining label pairs, and solving the problem in question for the labels in the pair as long as problematic label pairs can be determined and process-specific repeat criterion is met.
-
公开(公告)号:US20190220506A1
公开(公告)日:2019-07-18
申请号:US16241773
申请日:2019-01-07
发明人: Lassi Nieminen , Henri Pitkänen
CPC分类号: G06F17/241 , G06F17/5009 , G06F2217/74 , G06T11/60
摘要: A solution that automatically fine-tunes label locations in an engineering drawing is disclosed. The label locations are fine-tuned by performing a line-line solving process, a frame-frame solving process and a frame-line solving process according to a first order of the processes, and repeating performing the processes according to the first order as long as during performing the processes one or more frames have been moved to another location and a first repeat criterion is met. Each solving process repeats determining label pairs, and solving the problem in question for the labels in the pair as long as problematic label pairs can be determined and process-specific repeat criterion is met.
-
公开(公告)号:US10268347B2
公开(公告)日:2019-04-23
申请号:US15397173
申请日:2017-01-03
发明人: Jukka Lavonen , Teemu Heikkonen , Liisa Kause , Justiina Heilimo
IPC分类号: G06F3/0481 , G06F3/0482 , G06F3/0484 , G06F3/0485
摘要: To facilitate selection of a control that defines one or more commands to be performed to data content, a control display structure for an application is introduced. According to the structure, in a display area of a running application on a graphical user interface at least a first link and a second link are displayed in link area, at least a first container comprising at least one or more controls that are associated with the first link, and the second container comprising at least one or more controls that are associated with the second link, in a container area, wherein the controls displayed are freely selectable.
-
公开(公告)号:US20180364880A1
公开(公告)日:2018-12-20
申请号:US16011232
申请日:2018-06-18
发明人: Teemu Rantanen , Teemu Heikkonen , Justiina Heilimo , Jenny Ginman , Mika Uimonen , Jukka Lavonen , Sampo Syrjänen
IPC分类号: G06F3/0484 , G06F17/30
摘要: In a lossless undo mechanism history log information on completed actions and reversed actions created by one or more completed undo functions is maintained. The lossless undo mechanism causes an undo loop between a first state created by an action to which the undo function is performed and a second state created by the last reversed action of the completed undo function. The first and second state form a pair of ends of the undo loop. The pairs of ends are used to determine intersecting undo loops. Further, a predetermined rule set is used to determine which one of two or more intersecting undo loops is selected to be outputted as an undo loop in a tree-view structure that is outputted to illustrate the history log information.
-
公开(公告)号:US20240062160A1
公开(公告)日:2024-02-22
申请号:US18228821
申请日:2023-08-01
发明人: Jukka Suomi , Ragnar Wessman , Grant Higgins , Erling Tronsmoen , Ville Rousu
IPC分类号: G06Q10/10 , G06Q50/08 , G06Q10/0631
CPC分类号: G06Q10/103 , G06Q50/08 , G06Q10/06313 , G06Q10/06311 , G06Q10/06316
摘要: Mechanisms to facilitate task related information sharing between different parties of a project are disclosed. A task will have one or more dependent tasks. To share task related information of a first task, mutual access rights are provided per a pair of the first task and a dependent task. Thanks to the mutual access rights, a party responsible for the dependent task will have access rights to task related information of the first task and a party responsible for the first task will have access rights to task related information of the dependent task.
-
-
-
-
-
-
-
-
-